TSTP Solution File: SWV401+1 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : SWV401+1 : TPTP v8.2.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n001.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 : Mon Jun 24 17:35:52 EDT 2024
% Result : Theorem 0.19s 0.42s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 15
% Syntax : Number of formulae : 77 ( 5 unt; 0 def)
% Number of atoms : 221 ( 28 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 235 ( 91 ~; 89 |; 35 &)
% ( 9 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 8 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 159 ( 125 !; 34 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f174,plain,
$false,
inference(avatar_sat_refutation,[],[f93,f97,f108,f115,f126,f134,f148,f173]) ).
fof(f173,plain,
( ~ spl6_1
| ~ spl6_3 ),
inference(avatar_contradiction_clause,[],[f172]) ).
fof(f172,plain,
( $false
| ~ spl6_1
| ~ spl6_3 ),
inference(subsumption_resolution,[],[f171,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/benchmark/theBenchmark.p',unknown) ).
fof(f171,plain,
( ~ less_than(sK3,sK2)
| ~ spl6_1
| ~ spl6_3 ),
inference(subsumption_resolution,[],[f163,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,[],[f56]) ).
fof(f56,plain,
! [X2,X3,X0,X1,X4] :
( pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| X3 != X4
| X1 != X2 ),
inference(cnf_transformation,[],[f41]) ).
fof(f41,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,[],[f40]) ).
fof(f40,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/benchmark/theBenchmark.p',unknown) ).
fof(f163,plain,
( ~ pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK1,sK2)),sK1,sK2)
| ~ less_than(sK3,sK2)
| ~ spl6_1
| ~ spl6_3 ),
inference(superposition,[],[f156,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/benchmark/theBenchmark.p',unknown) ).
fof(f156,plain,
( ~ pair_in_list(update_slb(insert_slb(sK0,pair(sK1,sK2)),sK3),sK1,sK2)
| ~ spl6_1
| ~ spl6_3 ),
inference(backward_demodulation,[],[f150,f89]) ).
fof(f89,plain,
( sK1 = sK4
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f88]) ).
fof(f88,plain,
( spl6_1
<=> sK1 = sK4 ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
fof(f150,plain,
( ~ pair_in_list(update_slb(insert_slb(sK0,pair(sK4,sK2)),sK3),sK1,sK2)
| ~ spl6_3 ),
inference(backward_demodulation,[],[f45,f96]) ).
fof(f96,plain,
( sK2 = sK5
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f95]) ).
fof(f95,plain,
( spl6_3
<=> sK2 = sK5 ),
introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).
fof(f45,plain,
~ pair_in_list(update_slb(insert_slb(sK0,pair(sK4,sK5)),sK3),sK1,sK2),
inference(cnf_transformation,[],[f37]) ).
fof(f148,plain,
( ~ spl6_4
| spl6_6 ),
inference(avatar_contradiction_clause,[],[f147]) ).
fof(f147,plain,
( $false
| ~ spl6_4
| spl6_6 ),
inference(subsumption_resolution,[],[f146,f137]) ).
fof(f137,plain,
( less_than(sK5,sK3)
| spl6_6 ),
inference(unit_resulting_resolution,[],[f111,f48]) ).
fof(f48,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/benchmark/theBenchmark.p',unknown) ).
fof(f111,plain,
( ~ less_than(sK3,sK5)
| spl6_6 ),
inference(avatar_component_clause,[],[f110]) ).
fof(f110,plain,
( spl6_6
<=> less_than(sK3,sK5) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_6])]) ).
fof(f146,plain,
( ~ less_than(sK5,sK3)
| ~ spl6_4
| spl6_6 ),
inference(subsumption_resolution,[],[f141,f104]) ).
fof(f104,plain,
( strictly_less_than(sK5,sK3)
| ~ spl6_4 ),
inference(avatar_component_clause,[],[f103]) ).
fof(f103,plain,
( spl6_4
<=> strictly_less_than(sK5,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_4])]) ).
fof(f141,plain,
( ~ strictly_less_than(sK5,sK3)
| ~ less_than(sK5,sK3)
| spl6_6 ),
inference(resolution,[],[f111,f79]) ).
fof(f79,plain,
! [X0,X1] :
( less_than(X1,X0)
| ~ strictly_less_than(X0,X1)
| ~ less_than(X0,X1) ),
inference(consistent_polarity_flipping,[],[f64]) ).
fof(f64,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| less_than(X1,X0)
| ~ less_than(X0,X1) ),
inference(cnf_transformation,[],[f33]) ).
fof(f33,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| less_than(X1,X0)
| ~ less_than(X0,X1) ),
inference(flattening,[],[f32]) ).
fof(f32,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/benchmark/theBenchmark.p',unknown) ).
fof(f134,plain,
( ~ spl6_2
| spl6_7 ),
inference(avatar_contradiction_clause,[],[f133]) ).
fof(f133,plain,
( $false
| ~ spl6_2
| spl6_7 ),
inference(subsumption_resolution,[],[f130,f117]) ).
fof(f117,plain,
( pair_in_list(update_slb(sK0,sK3),sK1,sK2)
| ~ spl6_2 ),
inference(unit_resulting_resolution,[],[f44,f92,f42]) ).
fof(f42,plain,
! [X8,X6,X7] :
( pair_in_list(update_slb(sK0,X8),X6,X7)
| ~ less_than(X8,X7)
| ~ pair_in_list(sK0,X6,X7) ),
inference(cnf_transformation,[],[f37]) ).
fof(f92,plain,
( pair_in_list(sK0,sK1,sK2)
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f91]) ).
fof(f91,plain,
( spl6_2
<=> pair_in_list(sK0,sK1,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
fof(f130,plain,
( ~ pair_in_list(update_slb(sK0,sK3),sK1,sK2)
| spl6_7 ),
inference(resolution,[],[f114,f55]) ).
fof(f55,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,[],[f41]) ).
fof(f114,plain,
( ~ pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK4,sK5)),sK1,sK2)
| spl6_7 ),
inference(avatar_component_clause,[],[f113]) ).
fof(f113,plain,
( spl6_7
<=> pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK4,sK5)),sK1,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_7])]) ).
fof(f126,plain,
( ~ spl6_2
| spl6_5 ),
inference(avatar_contradiction_clause,[],[f125]) ).
fof(f125,plain,
( $false
| ~ spl6_2
| spl6_5 ),
inference(subsumption_resolution,[],[f122,f117]) ).
fof(f122,plain,
( ~ pair_in_list(update_slb(sK0,sK3),sK1,sK2)
| spl6_5 ),
inference(resolution,[],[f107,f55]) ).
fof(f107,plain,
( ~ pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK4,sK3)),sK1,sK2)
| spl6_5 ),
inference(avatar_component_clause,[],[f106]) ).
fof(f106,plain,
( spl6_5
<=> pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK4,sK3)),sK1,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_5])]) ).
fof(f115,plain,
( ~ spl6_6
| ~ spl6_7 ),
inference(avatar_split_clause,[],[f101,f113,f110]) ).
fof(f101,plain,
( ~ pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK4,sK5)),sK1,sK2)
| ~ less_than(sK3,sK5) ),
inference(superposition,[],[f45,f46]) ).
fof(f108,plain,
( spl6_4
| ~ spl6_5 ),
inference(avatar_split_clause,[],[f100,f106,f103]) ).
fof(f100,plain,
( ~ pair_in_list(insert_slb(update_slb(sK0,sK3),pair(sK4,sK3)),sK1,sK2)
| strictly_less_than(sK5,sK3) ),
inference(superposition,[],[f45,f74]) ).
fof(f74,plain,
! [X2,X3,X0,X1] :
( update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X2))
| strictly_less_than(X3,X2) ),
inference(consistent_polarity_flipping,[],[f58]) ).
fof(f58,plain,
! [X2,X3,X0,X1] :
( update_slb(insert_slb(X0,pair(X1,X3)),X2) = insert_slb(update_slb(X0,X2),pair(X1,X2))
| ~ strictly_less_than(X3,X2) ),
inference(cnf_transformation,[],[f27]) ).
fof(f27,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/benchmark/theBenchmark.p',unknown) ).
fof(f97,plain,
( spl6_3
| spl6_2 ),
inference(avatar_split_clause,[],[f86,f91,f95]) ).
fof(f86,plain,
( pair_in_list(sK0,sK1,sK2)
| sK2 = sK5 ),
inference(resolution,[],[f43,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)
| X3 = X4 ),
inference(cnf_transformation,[],[f41]) ).
fof(f43,plain,
pair_in_list(insert_slb(sK0,pair(sK4,sK5)),sK1,sK2),
inference(cnf_transformation,[],[f37]) ).
fof(f93,plain,
( spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f85,f91,f88]) ).
fof(f85,plain,
( pair_in_list(sK0,sK1,sK2)
| sK1 = sK4 ),
inference(resolution,[],[f43,f53]) ).
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)
| X1 = X2 ),
inference(cnf_transformation,[],[f41]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV401+1 : TPTP v8.2.0. Released v3.3.0.
% 0.07/0.12 % Command : run_vampire %s %d THM
% 0.12/0.32 % Computer : n001.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Thu Jun 20 14:17:09 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.12/0.34 This is a FOF_THM_RFO_SEQ problem
% 0.12/0.35 Running first-order theorem proving
% 0.12/0.35 Running /export/starexec/sandbox/solver/bin/vampire --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.39 % (6257)Running in auto input_syntax mode. Trying TPTP
% 0.12/0.39 % (6261)lrs+21_2461:262144_anc=none:drc=off:sil=2000:sp=occurrence:nwc=6.0:updr=off:st=3.0:i=109:sd=2:afp=4000:erml=3:nm=14:afq=2.0:uhcvi=on:ss=included:er=filter:abs=on:nicw=on:ile=on:sims=off:s2a=on:s2agt=50:s2at=-1.0:plsq=on:plsql=on:plsqc=2:plsqr=1,32:newcnf=on:bd=off:to=lpo_0 on theBenchmark for (2999ds/109Mi)
% 0.19/0.41 % (6257)Running in auto input_syntax mode. Trying TPTP
% 0.19/0.41 % (6258)ott+4_40_av=off:bce=on:fsd=off:fde=unused:nm=4:nwc=1.1:sos=all:sp=frequency:i=69040_0 on theBenchmark for (2999ds/69040Mi)
% 0.19/0.41 % (6257)Running in auto input_syntax mode. Trying TPTP
% 0.19/0.41 % (6260)dis+1011_1:99_anc=none:fde=unused:plsqc=2:bsd=on:plsq=on:plsqr=109,504:sp=reverse_frequency:spb=intro:rp=on:alpa=random:s2a=on:i=257151:s2at=-1.0:aac=none:nm=16:rawr=on:sil=256000:acc=model_0 on theBenchmark for (2999ds/257151Mi)
% 0.19/0.41 % (6261)Instruction limit reached!
% 0.19/0.41 % (6261)------------------------------
% 0.19/0.41 % (6261)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.19/0.41 % (6261)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.19/0.41 % (6261)Termination reason: Time limit
% 0.19/0.41 % (6261)Termination phase: Saturation
% 0.19/0.41
% 0.19/0.41 % (6261)Memory used [KB]: 1226
% 0.19/0.41 % (6261)Time elapsed: 0.027 s
% 0.19/0.41 % (6261)Instructions burned: 111 (million)
% 0.19/0.41 % (6257)Running in auto input_syntax mode. Trying TPTP
% 0.19/0.41 % (6259)lrs+1011_8:1_sil=128000:tgt=ground:fde=unused:sp=frequency:nwc=5.0:lwlo=on:i=105338:awrs=converge:awrsf=1385:av=off_0 on theBenchmark for (2999ds/105338Mi)
% 0.19/0.41 % (6257)Running in auto input_syntax mode. Trying TPTP
% 0.19/0.41 % (6263)ott-1011_16:1_sil=2000:sp=const_max:urr=on:lsd=20:st=3.0:i=117:ss=axioms:gsp=on:rp=on:sos=on:fd=off:aac=none_0 on theBenchmark for (2999ds/117Mi)
% 0.19/0.41 % (6257)Running in auto input_syntax mode. Trying TPTP
% 0.19/0.41 % (6262)lrs-1011_37821:262144_bsr=unit_only:sil=2000:fde=none:plsq=on:plsqr=43543,131072:bce=on:rnwc=on:plsql=on:rp=on:nwc=10.0:newcnf=on:i=109:awrs=decay:awrsf=10:ep=R:mep=off:amm=sco_0 on theBenchmark for (2999ds/109Mi)
% 0.19/0.41 % (6257)Running in auto input_syntax mode. Trying TPTP
% 0.19/0.41 % (6264)lrs+1010_1:1_to=lpo:sil=2000:sos=on:fd=off:i=117:bd=off_0 on theBenchmark for (2999ds/117Mi)
% 0.19/0.41 % (6262)Refutation not found, incomplete strategy% (6262)------------------------------
% 0.19/0.41 % (6262)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.19/0.41 % (6262)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.19/0.41 % (6262)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.41
% 0.19/0.41 % (6262)Memory used [KB]: 1082
% 0.19/0.41 % (6262)Time elapsed: 0.003 s
% 0.19/0.41 % (6262)Instructions burned: 2 (million)
% 0.19/0.41 % (6262)------------------------------
% 0.19/0.41 % (6262)------------------------------
% 0.19/0.42 % (6263)First to succeed.
% 0.19/0.42 % (6264)Also succeeded, but the first one will report.
% 0.19/0.42 % (6263)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-6257"
% 0.19/0.42 % (6257)Running in auto input_syntax mode. Trying TPTP
% 0.19/0.42 % (6263)Refutation found. Thanks to Tanya!
% 0.19/0.42 % SZS status Theorem for theBenchmark
% 0.19/0.42 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.42 % (6263)------------------------------
% 0.19/0.42 % (6263)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.19/0.42 % (6263)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.19/0.42 % (6263)Termination reason: Refutation
% 0.19/0.42
% 0.19/0.42 % (6263)Memory used [KB]: 1200
% 0.19/0.42 % (6263)Time elapsed: 0.007 s
% 0.19/0.42 % (6263)Instructions burned: 8 (million)
% 0.19/0.42 % (6263)------------------------------
% 0.19/0.42 % (6263)------------------------------
% 0.19/0.42 % (6257)Success in time 0.066 s
%------------------------------------------------------------------------------