%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL004-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 11:50:54 AM UTC 2026
% Result : Unsatisfiable 3.34s 11.46s
% Output : Refutation 3.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 8
% Syntax : Number of formulae : 47 ( 12 unt; 5 def)
% Number of atoms : 97 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 97 ( 47 ~; 45 |; 0 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 7 ( 6 usr; 6 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 99 ( 0 sgn 99 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ~ is_a_theorem(or(not(X0),X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f2,axiom,
! [X2,X3,X0,X1,X4] : is_a_theorem(or(not(or(not(or(not(X0),X1)),or(X2,or(X3,X4)))),or(not(or(not(X3),X0)),or(X2,or(X4,X0))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',an_CAMeredith) ).
fof(f3,negated_conjecture,
~ is_a_theorem(or(not(a),or(b,a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',an_3) ).
fof(f4,plain,
! [X2,X3,X0,X1,X4] :
( is_a_theorem(or(not(or(not(X3),X0)),or(X2,or(X4,X0))))
| ~ is_a_theorem(or(not(or(not(X0),X1)),or(X2,or(X3,X4)))) ),
inference(resolution,[],[f2,f1]) ).
fof(f5,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(or(not(or(not(X0),X1)),or(X2,or(X3,X4))))
| ~ is_a_theorem(or(not(X3),X0))
| is_a_theorem(or(X2,or(X4,X0))) ),
inference(resolution,[],[f4,f1]) ).
fof(f7,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(or(not(or(not(X3),X4)),or(X2,or(X1,X0))))
| is_a_theorem(or(X2,or(X3,X1)))
| ~ is_a_theorem(or(not(X0),X1)) ),
inference(resolution,[],[f5,f4]) ).
fof(f11,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(or(not(or(not(X3),X4)),or(X0,or(X1,X2))))
| ~ is_a_theorem(or(not(X3),X2))
| is_a_theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f7,f4]) ).
fof(f16,plain,
! [X2,X3,X0,X1,X4] :
( is_a_theorem(or(not(or(not(X3),X0)),or(X4,or(X2,X0))))
| ~ is_a_theorem(or(not(or(not(X0),X1)),or(X2,X0))) ),
inference(resolution,[],[f11,f2]) ).
fof(f20,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(or(not(or(not(X0),X1)),or(X2,X0)))
| ~ is_a_theorem(or(not(X3),X0))
| is_a_theorem(or(X4,or(X2,X0))) ),
inference(resolution,[],[f16,f11]) ).
fof(f25,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ is_a_theorem(or(not(or(not(X2),X5)),or(X1,X2)))
| is_a_theorem(or(X3,or(X4,or(X1,X2))))
| ~ is_a_theorem(or(not(X0),or(X1,X2))) ),
inference(resolution,[],[f20,f16]) ).
fof(f48,definition,
( spl0_1
<=> ! [X3] : ~ is_a_theorem(X3) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f49,plain,
( ! [X3] : ~ is_a_theorem(X3)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f48]) ).
fof(f73,plain,
( $false
| ~ spl0_1 ),
inference(resolution,[],[f49,f2]) ).
fof(f89,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f73]) ).
fof(f224,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(or(not(or(not(X0),X1)),or(X2,X0)))
| is_a_theorem(or(X3,or(X4,or(X2,X0)))) ),
inference(factoring,[],[f25]) ).
fof(f232,plain,
! [X2,X3,X0,X1,X4] : is_a_theorem(or(X0,or(X1,or(not(or(not(X2),X3)),or(not(X3),or(X4,X3)))))),
inference(resolution,[],[f224,f2]) ).
fof(f244,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(X0)
| is_a_theorem(or(X1,or(not(or(not(X2),X3)),or(not(X3),or(X4,X3))))) ),
inference(resolution,[],[f232,f1]) ).
fof(f262,definition,
( spl0_9
<=> ! [X4,X2,X1,X3] : is_a_theorem(or(X1,or(not(or(not(X2),X3)),or(not(X3),or(X4,X3))))) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f263,plain,
( ! [X2,X3,X1,X4] : is_a_theorem(or(X1,or(not(or(not(X2),X3)),or(not(X3),or(X4,X3)))))
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f262]) ).
fof(f264,plain,
( spl0_9
| spl0_1 ),
inference(avatar_split_clause,[],[f244,f48,f262]) ).
fof(f285,plain,
( ! [X2,X3,X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(or(not(or(not(X1),X2)),or(not(X2),or(X3,X2)))) )
| ~ spl0_9 ),
inference(resolution,[],[f263,f1]) ).
fof(f300,definition,
( spl0_11
<=> ! [X2,X1,X3] : is_a_theorem(or(not(or(not(X1),X2)),or(not(X2),or(X3,X2)))) ),
introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).
fof(f301,plain,
( ! [X2,X3,X1] : is_a_theorem(or(not(or(not(X1),X2)),or(not(X2),or(X3,X2))))
| ~ spl0_11 ),
inference(avatar_component_clause,[],[f300]) ).
fof(f302,plain,
( spl0_11
| spl0_1
| ~ spl0_9 ),
inference(avatar_split_clause,[],[f285,f262,f48,f300]) ).
fof(f322,plain,
( ! [X2,X3,X0,X1] : is_a_theorem(or(X0,or(X1,or(not(X2),or(X3,X2)))))
| ~ spl0_11 ),
inference(resolution,[],[f301,f224]) ).
fof(f336,plain,
( ! [X2,X3,X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(or(X1,or(not(X2),or(X3,X2)))) )
| ~ spl0_11 ),
inference(resolution,[],[f322,f1]) ).
fof(f354,definition,
( spl0_12
<=> ! [X2,X1,X3] : is_a_theorem(or(X1,or(not(X2),or(X3,X2)))) ),
introduced(definition,[new_symbols(definition,[spl0_12])],[avatar_definition]) ).
fof(f355,plain,
( ! [X2,X3,X1] : is_a_theorem(or(X1,or(not(X2),or(X3,X2))))
| ~ spl0_12 ),
inference(avatar_component_clause,[],[f354]) ).
fof(f356,plain,
( spl0_12
| spl0_1
| ~ spl0_11 ),
inference(avatar_split_clause,[],[f336,f300,f48,f354]) ).
fof(f366,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(or(not(X1),or(X2,X1))) )
| ~ spl0_12 ),
inference(resolution,[],[f355,f1]) ).
fof(f384,definition,
( spl0_13
<=> ! [X2,X1] : is_a_theorem(or(not(X1),or(X2,X1))) ),
introduced(definition,[new_symbols(definition,[spl0_13])],[avatar_definition]) ).
fof(f385,plain,
( ! [X2,X1] : is_a_theorem(or(not(X1),or(X2,X1)))
| ~ spl0_13 ),
inference(avatar_component_clause,[],[f384]) ).
fof(f386,plain,
( spl0_13
| spl0_1
| ~ spl0_12 ),
inference(avatar_split_clause,[],[f366,f354,f48,f384]) ).
fof(f407,plain,
( $false
| ~ spl0_13 ),
inference(resolution,[],[f385,f3]) ).
fof(f415,plain,
~ spl0_13,
inference(avatar_contradiction_clause,[],[f407]) ).
cnf(s3,plain,
~ spl0_1,
inference(sat_conversion,[],[f89]) ).
cnf(s9,plain,
( spl0_1
| spl0_9 ),
inference(sat_conversion,[],[f264]) ).
cnf(s11,plain,
( spl0_1
| ~ spl0_9
| spl0_11 ),
inference(sat_conversion,[],[f302]) ).
cnf(s12,plain,
( spl0_1
| ~ spl0_11
| spl0_12 ),
inference(sat_conversion,[],[f356]) ).
cnf(s13,plain,
( spl0_1
| ~ spl0_12
| spl0_13 ),
inference(sat_conversion,[],[f386]) ).
cnf(s14,plain,
~ spl0_13,
inference(sat_conversion,[],[f415]) ).
cnf(s15,plain,
( spl0_1
| ~ spl0_12 ),
inference(rat,[],[s13,s14]) ).
cnf(s16,plain,
~ spl0_12,
inference(rat,[],[s15,s3]) ).
cnf(s17,plain,
~ spl0_11,
inference(rat,[],[s12,s16,s3]) ).
cnf(s18,plain,
~ spl0_9,
inference(rat,[],[s11,s17,s3]) ).
cnf(s25,plain,
$false,
inference(rat,[],[s9,s18,s3]) ).
fof(f416,plain,
$false,
inference(avatar_sat_refutation,[],[s25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL004-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/10.38 % Computer : n008.cluster.edu
% 0.10/10.38 % Model : x86_64 x86_64
% 0.10/10.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.38 % Memory : 8046.5625MB
% 0.10/10.38 % OS : Linux 6.8.0-71-generic
% 0.10/10.38 % CPULimit : 300
% 0.10/10.38 % WCLimit : 300
% 0.10/10.38 % DateTime : Sun Sep 27 15:17:21 UTC 2026
% 0.10/10.39 % CPUTime :
% 0.10/10.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/10.42 Running first-order theorem proving
% 0.13/10.42 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.34/11.46 % (1360107)Input is clausal, will run a generic CNF schedule.
% 3.34/11.46 % (1360114)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3935917368:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.34/11.46 % (1360116)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3126932865:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.34/11.46 % (1360115)lrs+10_1_sil=8000:sp=occurrence:random_seed=3806784954:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.34/11.46 % (1360113)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1214191087:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.34/11.46 % (1360112)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=4111754560:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.34/11.46 % (1360116)First to succeed.
% 3.34/11.46 % (1360117)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1806383703:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.34/11.46 % (1360118)dis-21_1_sil=8000:lcm=predicate:random_seed=1007622233:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 3.34/11.46 % (1360116)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1360107"
% 3.34/11.46 % (1360118)Also succeeded, but the first one will report.
% 3.34/11.46 % (1360115)Instruction limit reached!
% 3.34/11.46 % (1360115)------------------------------
% 3.34/11.46 % (1360115)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.34/11.46 % (1360115)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.34/11.46 % (1360115)CaDiCaL version: 2.1.3
% 3.34/11.46 % (1360115)Termination reason: Instruction limit
% 3.34/11.46 % (1360115)Termination phase: Saturation
% 3.34/11.46 % (1360115)Time elapsed: 0.068 s
% 3.34/11.46 % (1360115)Peak memory usage: 90 MB
% 3.34/11.46 % (1360115)Instructions burned: 108 (million)
% 3.34/11.46 % (1360117)Instruction limit reached!
% 3.34/11.46 % (1360117)------------------------------
% 3.34/11.46 % (1360117)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.34/11.46 % (1360117)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.34/11.46 % (1360117)CaDiCaL version: 2.1.3
% 3.34/11.46 % (1360117)Termination reason: Instruction limit
% 3.34/11.46 % (1360117)Termination phase: Saturation
% 3.34/11.46 % (1360117)Time elapsed: 0.115 s
% 3.34/11.46 % (1360117)Peak memory usage: 89 MB
% 3.34/11.46 % (1360117)Instructions burned: 180 (million)
% 3.34/11.46 % (1360126)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=3469124324:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 3.34/11.46 % (1360126)Refutation not found, incomplete strategy
% 3.34/11.46 % (1360126)------------------------------
% 3.34/11.46 % (1360126)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.34/11.46 % (1360126)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.34/11.46 % (1360126)CaDiCaL version: 2.1.3
% 3.34/11.46 % (1360126)Termination reason: Refutation not found, incomplete strategy
% 3.34/11.46 % (1360126)Time elapsed: 0.001 s
% 3.34/11.46 % (1360126)Peak memory usage: 87 MB
% 3.34/11.46 % (1360127)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=2257965924:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2996 on theBenchmark for (2996ds/189Mi)
% 3.34/11.46 % (1360116)Refutation found. Thanks to Tanya!
% 3.34/11.46 % SZS status Unsatisfiable for theBenchmark
% 3.34/11.46 % SZS output start Proof for theBenchmark
% See solution above
% 3.34/11.47 % (1360116)------------------------------
% 3.34/11.47 % (1360116)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.34/11.47 % (1360116)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.34/11.47 % (1360116)CaDiCaL version: 2.1.3
% 3.34/11.47 % (1360116)Termination reason: Refutation
% 3.34/11.47 % (1360116)Time elapsed: 0.012 s
% 3.34/11.47 % (1360116)Peak memory usage: 89 MB
% 3.34/11.47 % (1360116)Instructions burned: 16 (million)
% 3.34/11.47 % (1360116)------------------------------
% 3.34/11.47 % (1360116)------------------------------
% 3.34/11.47 % (1360107)Success in time 0.518 s
% 3.34/11.47 % Vampire exiting
%------------------------------------------------------------------------------