TSTP Solution File: SWV401+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV401+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 10:29:29 EDT 2024
% Result : Theorem 0.57s 0.76s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of formulae : 71 ( 5 unt; 0 def)
% Number of atoms : 210 ( 30 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 228 ( 89 ~; 86 |; 35 &)
% ( 7 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 6 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 164 ( 130 !; 34 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f155,plain,
$false,
inference(avatar_sat_refutation,[],[f85,f104,f124,f129,f134,f149]) ).
fof(f149,plain,
( ~ spl6_1
| ~ spl6_5 ),
inference(avatar_contradiction_clause,[],[f148]) ).
fof(f148,plain,
( $false
| ~ spl6_1
| ~ spl6_5 ),
inference(subsumption_resolution,[],[f147,f44]) ).
fof(f44,plain,
less_than(sK3,sK2),
inference(cnf_transformation,[],[f37]) ).
fof(f37,plain,
( ~ pair_in_list(update_slb(insert_slb(sK0,pair(sK4,sK5)),sK3),sK1,sK2)
& less_than(sK3,sK2)
& pair_in_list(insert_slb(sK0,pair(sK4,sK5)),sK1,sK2)
& ! [X6,X7,X8] :
( pair_in_list(update_slb(sK0,X8),X6,X7)
| ~ less_than(X8,X7)
| ~ pair_in_list(sK0,X6,X7) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f34,f36,f35]) ).
fof(f35,plain,
( ? [X0] :
( ? [X1,X2,X3,X4,X5] :
( ~ pair_in_list(update_slb(insert_slb(X0,pair(X4,X5)),X3),X1,X2)
& less_than(X3,X2)
& pair_in_list(insert_slb(X0,pair(X4,X5)),X1,X2) )
& ! [X6,X7,X8] :
( pair_in_list(update_slb(X0,X8),X6,X7)
| ~ less_than(X8,X7)
| ~ pair_in_list(X0,X6,X7) ) )
=> ( ? [X5,X4,X3,X2,X1] :
( ~ pair_in_list(update_slb(insert_slb(sK0,pair(X4,X5)),X3),X1,X2)
& less_than(X3,X2)
& pair_in_list(insert_slb(sK0,pair(X4,X5)),X1,X2) )
& ! [X8,X7,X6] :
( pair_in_list(update_slb(sK0,X8),X6,X7)
| ~ less_than(X8,X7)
| ~ pair_in_list(sK0,X6,X7) ) ) ),
introduced(choice_axiom,[]) ).
fof(f36,plain,
( ? [X5,X4,X3,X2,X1] :
( ~ pair_in_list(update_slb(insert_slb(sK0,pair(X4,X5)),X3),X1,X2)
& less_than(X3,X2)
& pair_in_list(insert_slb(sK0,pair(X4,X5)),X1,X2) )
=> ( ~ pair_in_list(update_slb(insert_slb(sK0,pair(sK4,sK5)),sK3),sK1,sK2)
& less_than(sK3,sK2)
& pair_in_list(insert_slb(sK0,pair(sK4,sK5)),sK1,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f34,plain,
? [X0] :
( ? [X1,X2,X3,X4,X5] :
( ~ pair_in_list(update_slb(insert_slb(X0,pair(X4,X5)),X3),X1,X2)
& less_than(X3,X2)
& pair_in_list(insert_slb(X0,pair(X4,X5)),X1,X2) )
& ! [X6,X7,X8] :
( pair_in_list(update_slb(X0,X8),X6,X7)
| ~ less_than(X8,X7)
| ~ pair_in_list(X0,X6,X7) ) ),
inference(rectify,[],[f23]) ).
fof(f23,plain,
? [X0] :
( ? [X4,X5,X6,X7,X8] :
( ~ pair_in_list(update_slb(insert_slb(X0,pair(X7,X8)),X6),X4,X5)
& less_than(X6,X5)
& pair_in_list(insert_slb(X0,pair(X7,X8)),X4,X5) )
& ! [X1,X2,X3] :
( pair_in_list(update_slb(X0,X3),X1,X2)
| ~ less_than(X3,X2)
| ~ pair_in_list(X0,X1,X2) ) ),
inference(flattening,[],[f22]) ).
fof(f22,plain,
? [X0] :
( ? [X4,X5,X6,X7,X8] :
( ~ pair_in_list(update_slb(insert_slb(X0,pair(X7,X8)),X6),X4,X5)
& less_than(X6,X5)
& pair_in_list(insert_slb(X0,pair(X7,X8)),X4,X5) )
& ! [X1,X2,X3] :
( pair_in_list(update_slb(X0,X3),X1,X2)
| ~ less_than(X3,X2)
| ~ pair_in_list(X0,X1,X2) ) ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,negated_conjecture,
~ ! [X0] :
( ! [X1,X2,X3] :
( ( less_than(X3,X2)
& pair_in_list(X0,X1,X2) )
=> pair_in_list(update_slb(X0,X3),X1,X2) )
=> ! [X4,X5,X6,X7,X8] :
( ( less_than(X6,X5)
& pair_in_list(insert_slb(X0,pair(X7,X8)),X4,X5) )
=> pair_in_list(update_slb(insert_slb(X0,pair(X7,X8)),X6),X4,X5) ) ),
inference(negated_conjecture,[],[f19]) ).
fof(f19,conjecture,
! [X0] :
( ! [X1,X2,X3] :
( ( less_than(X3,X2)
& pair_in_list(X0,X1,X2) )
=> pair_in_list(update_slb(X0,X3),X1,X2) )
=> ! [X4,X5,X6,X7,X8] :
( ( less_than(X6,X5)
& pair_in_list(insert_slb(X0,pair(X7,X8)),X4,X5) )
=> pair_in_list(update_slb(insert_slb(X0,pair(X7,X8)),X6),X4,X5) ) ),
file('/export/starexec/sandbox/tmp/tmp.EE8iSzQUUd/Vampire---4.8_9971',l37_co) ).
fof(f147,plain,
( ~ less_than(sK3,sK2)
| ~ spl6_1
| ~ spl6_5 ),
inference(forward_demodulation,[],[f146,f133]) ).
fof(f133,plain,
( sK2 = sK5
| ~ spl6_5 ),
inference(avatar_component_clause,[],[f131]) ).
fof(f131,plain,
( spl6_5
<=> sK2 = sK5 ),
introduced(avatar_definition,[new_symbols(naming,[spl6_5])]) ).
fof(f146,plain,
( ~ less_than(sK3,sK5)
| ~ spl6_1
| ~ spl6_5 ),
inference(subsumption_resolution,[],[f145,f70]) ).
fof(f70,plain,
! [X2,X0,X4] : pair_in_list(insert_slb(X0,pair(X2,X4)),X2,X4),
inference(equality_resolution,[],[f69]) ).
fof(f69,plain,
! [X2,X0,X1,X4] :
( pair_in_list(insert_slb(X0,pair(X1,X4)),X2,X4)
| X1 != X2 ),
inference(equality_resolution,[],[f55]) ).
fof(f55,plain,
! [X2,X3,X0,X1,X4] :
( pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| X3 != X4
| X1 != X2 ),
inference(cnf_transformation,[],[f39]) ).
fof(f39,plain,
! [X0,X1,X2,X3,X4] :
( ( pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| ( ( X3 != X4
| X1 != X2 )
& ~ pair_in_list(X0,X2,X4) ) )
& ( ( X3 = X4
& X1 = X2 )
| pair_in_list(X0,X2,X4)
| ~ pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4) ) ),
inference(flattening,[],[f38]) ).
fof(f38,plain,
! [X0,X1,X2,X3,X4] :
( ( pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| ( ( X3 != X4
| X1 != X2 )
& ~ pair_in_list(X0,X2,X4) ) )
& ( ( X3 = X4
& X1 = X2 )
| pair_in_list(X0,X2,X4)
| ~ pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f11,axiom,
! [X0,X1,X2,X3,X4] :
( pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
<=> ( ( X3 = X4
& X1 = X2 )
| pair_in_list(X0,X2,X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.EE8iSzQUUd/Vampire---4.8_9971',ax23) ).
fof(f145,plain,
( ~ pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK1,sK2)),sK1,sK2)
| ~ less_than(sK3,sK5)
| ~ spl6_1
| ~ spl6_5 ),
inference(forward_demodulation,[],[f144,f80]) ).
fof(f80,plain,
( sK1 = sK4
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f78]) ).
fof(f78,plain,
( spl6_1
<=> sK1 = sK4 ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
fof(f144,plain,
( ~ pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK4,sK2)),sK1,sK2)
| ~ less_than(sK3,sK5)
| ~ spl6_5 ),
inference(forward_demodulation,[],[f125,f133]) ).
fof(f125,plain,
( ~ pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK4,sK5)),sK1,sK2)
| ~ less_than(sK3,sK5) ),
inference(superposition,[],[f45,f46]) ).
fof(f46,plain,
! [X2,X3,X0,X1] :
( update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X3))
| ~ less_than(X2,X3) ),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1,X2,X3] :
( update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X3))
| ~ less_than(X2,X3) ),
inference(ennf_transformation,[],[f18]) ).
fof(f18,axiom,
! [X0,X1,X2,X3] :
( less_than(X2,X3)
=> update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.EE8iSzQUUd/Vampire---4.8_9971',ax30) ).
fof(f45,plain,
~ pair_in_list(update_slb(insert_slb(sK0,pair(sK4,sK5)),sK3),sK1,sK2),
inference(cnf_transformation,[],[f37]) ).
fof(f134,plain,
( spl6_5
| spl6_2 ),
inference(avatar_split_clause,[],[f87,f82,f131]) ).
fof(f82,plain,
( spl6_2
<=> pair_in_list(sK0,sK1,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
fof(f87,plain,
( pair_in_list(sK0,sK1,sK2)
| sK2 = sK5 ),
inference(resolution,[],[f53,f43]) ).
fof(f43,plain,
pair_in_list(insert_slb(sK0,pair(sK4,sK5)),sK1,sK2),
inference(cnf_transformation,[],[f37]) ).
fof(f53,plain,
! [X2,X3,X0,X1,X4] :
( ~ pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| pair_in_list(X0,X2,X4)
| X3 = X4 ),
inference(cnf_transformation,[],[f39]) ).
fof(f129,plain,
( ~ spl6_2
| spl6_4 ),
inference(avatar_contradiction_clause,[],[f128]) ).
fof(f128,plain,
( $false
| ~ spl6_2
| spl6_4 ),
inference(subsumption_resolution,[],[f127,f44]) ).
fof(f127,plain,
( ~ less_than(sK3,sK2)
| ~ spl6_2
| spl6_4 ),
inference(resolution,[],[f126,f86]) ).
fof(f86,plain,
( ! [X0] :
( pair_in_list(update_slb(sK0,X0),sK1,sK2)
| ~ less_than(X0,sK2) )
| ~ spl6_2 ),
inference(resolution,[],[f84,f42]) ).
fof(f42,plain,
! [X8,X6,X7] :
( ~ pair_in_list(sK0,X6,X7)
| ~ less_than(X8,X7)
| pair_in_list(update_slb(sK0,X8),X6,X7) ),
inference(cnf_transformation,[],[f37]) ).
fof(f84,plain,
( pair_in_list(sK0,sK1,sK2)
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f82]) ).
fof(f126,plain,
( ~ pair_in_list(update_slb(sK0,sK3),sK1,sK2)
| spl6_4 ),
inference(resolution,[],[f103,f54]) ).
fof(f54,plain,
! [X2,X3,X0,X1,X4] :
( pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| ~ pair_in_list(X0,X2,X4) ),
inference(cnf_transformation,[],[f39]) ).
fof(f103,plain,
( ~ pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK4,sK5)),sK1,sK2)
| spl6_4 ),
inference(avatar_component_clause,[],[f101]) ).
fof(f101,plain,
( spl6_4
<=> pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK4,sK5)),sK1,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_4])]) ).
fof(f124,plain,
( ~ spl6_2
| spl6_3 ),
inference(avatar_contradiction_clause,[],[f123]) ).
fof(f123,plain,
( $false
| ~ spl6_2
| spl6_3 ),
inference(subsumption_resolution,[],[f122,f44]) ).
fof(f122,plain,
( ~ less_than(sK3,sK2)
| ~ spl6_2
| spl6_3 ),
inference(resolution,[],[f121,f86]) ).
fof(f121,plain,
( ~ pair_in_list(update_slb(sK0,sK3),sK1,sK2)
| spl6_3 ),
inference(resolution,[],[f117,f54]) ).
fof(f117,plain,
( ~ pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK4,sK3)),sK1,sK2)
| spl6_3 ),
inference(backward_demodulation,[],[f45,f115]) ).
fof(f115,plain,
( ! [X0,X1] : update_slb(insert_slb(X0,pair(X1,sK5)),sK3) = insert_slb(update_slb(X0,sK3),pair(X1,sK3))
| spl6_3 ),
inference(resolution,[],[f108,f99]) ).
fof(f99,plain,
( ~ less_than(sK3,sK5)
| spl6_3 ),
inference(avatar_component_clause,[],[f97]) ).
fof(f97,plain,
( spl6_3
<=> less_than(sK3,sK5) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).
fof(f108,plain,
! [X2,X3,X0,X1] :
( less_than(X3,X2)
| update_slb(insert_slb(X0,pair(X1,X2)),X3) = insert_slb(update_slb(X0,X3),pair(X1,X3)) ),
inference(subsumption_resolution,[],[f107,f50]) ).
fof(f50,plain,
! [X0,X1] :
( less_than(X1,X0)
| less_than(X0,X1) ),
inference(cnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( less_than(X1,X0)
| less_than(X0,X1) ),
file('/export/starexec/sandbox/tmp/tmp.EE8iSzQUUd/Vampire---4.8_9971',totality) ).
fof(f107,plain,
! [X2,X3,X0,X1] :
( update_slb(insert_slb(X0,pair(X1,X2)),X3) = insert_slb(update_slb(X0,X3),pair(X1,X3))
| less_than(X3,X2)
| ~ less_than(X2,X3) ),
inference(resolution,[],[f57,f48]) ).
fof(f48,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| less_than(X1,X0)
| ~ less_than(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| less_than(X1,X0)
| ~ less_than(X0,X1) ),
inference(flattening,[],[f25]) ).
fof(f25,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| less_than(X1,X0)
| ~ less_than(X0,X1) ),
inference(ennf_transformation,[],[f21]) ).
fof(f21,plain,
! [X0,X1] :
( ( ~ less_than(X1,X0)
& less_than(X0,X1) )
=> strictly_less_than(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] :
( strictly_less_than(X0,X1)
<=> ( ~ less_than(X1,X0)
& less_than(X0,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.EE8iSzQUUd/Vampire---4.8_9971',stricly_smaller_definition) ).
fof(f57,plain,
! [X2,X3,X0,X1] :
( ~ strictly_less_than(X3,X2)
| update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X2)) ),
inference(cnf_transformation,[],[f29]) ).
fof(f29,plain,
! [X0,X1,X2,X3] :
( update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X2))
| ~ strictly_less_than(X3,X2) ),
inference(ennf_transformation,[],[f17]) ).
fof(f17,axiom,
! [X0,X1,X2,X3] :
( strictly_less_than(X3,X2)
=> update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.EE8iSzQUUd/Vampire---4.8_9971',ax29) ).
fof(f104,plain,
( ~ spl6_3
| ~ spl6_4 ),
inference(avatar_split_clause,[],[f95,f101,f97]) ).
fof(f95,plain,
( ~ pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK4,sK5)),sK1,sK2)
| ~ less_than(sK3,sK5) ),
inference(superposition,[],[f45,f46]) ).
fof(f85,plain,
( spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f74,f82,f78]) ).
fof(f74,plain,
( pair_in_list(sK0,sK1,sK2)
| sK1 = sK4 ),
inference(resolution,[],[f52,f43]) ).
fof(f52,plain,
! [X2,X3,X0,X1,X4] :
( ~ pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| pair_in_list(X0,X2,X4)
| X1 = X2 ),
inference(cnf_transformation,[],[f39]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWV401+1 : TPTP v8.1.2. Released v3.3.0.
% 0.13/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36 % Computer : n026.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 20:56:23 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.36 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.EE8iSzQUUd/Vampire---4.8_9971
% 0.57/0.75 % (10086)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.57/0.75 % (10086)Refutation not found, incomplete strategy% (10086)------------------------------
% 0.57/0.75 % (10086)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.75 % (10086)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.75
% 0.57/0.75 % (10079)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2996ds/34Mi)
% 0.57/0.75 % (10086)Memory used [KB]: 1055
% 0.57/0.75 % (10086)Time elapsed: 0.002 s
% 0.57/0.75 % (10086)Instructions burned: 3 (million)
% 0.57/0.75 % (10081)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.57/0.75 % (10080)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2996ds/51Mi)
% 0.57/0.75 % (10083)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2996ds/34Mi)
% 0.57/0.75 % (10084)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.57/0.75 % (10086)------------------------------
% 0.57/0.75 % (10086)------------------------------
% 0.57/0.75 % (10082)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.57/0.75 % (10085)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2996ds/83Mi)
% 0.57/0.75 % (10079)Refutation not found, incomplete strategy% (10079)------------------------------
% 0.57/0.75 % (10079)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.75 % (10079)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.75
% 0.57/0.75 % (10079)Memory used [KB]: 1059
% 0.57/0.75 % (10079)Time elapsed: 0.004 s
% 0.57/0.75 % (10079)Instructions burned: 3 (million)
% 0.57/0.75 % (10079)------------------------------
% 0.57/0.75 % (10079)------------------------------
% 0.57/0.75 % (10087)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on Vampire---4 for (2996ds/55Mi)
% 0.57/0.75 % (10081)First to succeed.
% 0.57/0.75 % (10081)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-10078"
% 0.57/0.75 % (10088)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on Vampire---4 for (2996ds/50Mi)
% 0.57/0.76 % (10081)Refutation found. Thanks to Tanya!
% 0.57/0.76 % SZS status Theorem for Vampire---4
% 0.57/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.57/0.76 % (10081)------------------------------
% 0.57/0.76 % (10081)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.76 % (10081)Termination reason: Refutation
% 0.57/0.76
% 0.57/0.76 % (10081)Memory used [KB]: 1094
% 0.57/0.76 % (10081)Time elapsed: 0.008 s
% 0.57/0.76 % (10081)Instructions burned: 10 (million)
% 0.57/0.76 % (10078)Success in time 0.386 s
% 0.57/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------