%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL273-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n005.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:58:15 AM UTC 2026
% Result : Unsatisfiable 0.89s 0.61s
% Output : Refutation 0.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of formulae : 55 ( 31 unt; 2 def)
% Number of atoms : 84 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 59 ( 30 ~; 27 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 74 ( 0 sgn 74 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
fof(f2,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
fof(f3,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
fof(f4,axiom,
! [X2,X0,X1] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
fof(f5,axiom,
! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
fof(f6,axiom,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
fof(f7,axiom,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_1) ).
fof(f8,axiom,
! [X0,X1] :
( theorem(X0)
| ~ theorem(implies(X1,X0))
| ~ theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_2) ).
fof(f9,axiom,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-1.ax',and_defn) ).
fof(f10,axiom,
! [X0,X1] : equivalent(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).
fof(f11,negated_conjecture,
~ theorem(equivalent(and(p,q),and(q,p))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f12,plain,
! [X0,X1] : equivalent(X0,X1) = not(or(not(or(not(X0),X1)),not(or(not(X1),X0)))),
inference(definition_unfolding,[],[f10,f9,f6,f6]) ).
fof(f13,plain,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f1,f6]) ).
fof(f14,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f2,f6]) ).
fof(f15,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f3,f6]) ).
fof(f16,plain,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f4,f6]) ).
fof(f17,plain,
! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(definition_unfolding,[],[f5,f6,f6,f6]) ).
fof(f18,plain,
! [X0,X1] :
( ~ theorem(or(not(X1),X0))
| theorem(X0)
| ~ theorem(X1) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f19,plain,
~ theorem(not(or(not(or(not(not(or(not(p),not(q)))),not(or(not(q),not(p))))),not(or(not(not(or(not(q),not(p)))),not(or(not(p),not(q)))))))),
inference(definition_unfolding,[],[f11,f12,f9,f9]) ).
fof(f20,plain,
! [X0] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[],[f13,f7]) ).
fof(f21,plain,
! [X0] :
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(resolution,[],[f20,f18]) ).
fof(f22,plain,
! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
inference(resolution,[],[f14,f7]) ).
fof(f26,plain,
! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(resolution,[],[f15,f7]) ).
fof(f27,plain,
! [X0,X1] :
( ~ theorem(or(X1,X0))
| theorem(or(X0,X1)) ),
inference(resolution,[],[f26,f18]) ).
fof(f42,plain,
! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(resolution,[],[f16,f7]) ).
fof(f50,plain,
! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(resolution,[],[f17,f7]) ).
fof(f69,plain,
! [X2,X0,X1] :
( ~ theorem(or(X1,or(X0,X2)))
| theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f42,f18]) ).
fof(f73,plain,
! [X0,X1] : theorem(or(X0,or(not(X1),X1))),
inference(resolution,[],[f69,f22]) ).
fof(f74,plain,
! [X0,X1] : theorem(or(X0,or(not(or(X1,X0)),X1))),
inference(resolution,[],[f69,f26]) ).
fof(f78,plain,
! [X0] : theorem(or(not(X0),X0)),
inference(resolution,[],[f73,f21]) ).
fof(f113,plain,
! [X0] : theorem(or(X0,not(X0))),
inference(resolution,[],[f27,f78]) ).
fof(f138,plain,
! [X0,X1] :
( theorem(or(not(or(X0,not(X1))),X0))
| ~ theorem(X1) ),
inference(resolution,[],[f74,f18]) ).
fof(f146,plain,
! [X0,X1] :
( ~ theorem(or(X1,not(X0)))
| theorem(X1)
| ~ theorem(X0) ),
inference(resolution,[],[f138,f18]) ).
fof(f153,plain,
! [X0,X1] :
( theorem(not(or(not(X0),not(X1))))
| ~ theorem(X0)
| ~ theorem(X1) ),
inference(resolution,[],[f146,f138]) ).
fof(f262,plain,
( ~ theorem(or(not(not(or(not(p),not(q)))),not(or(not(q),not(p)))))
| ~ theorem(or(not(not(or(not(q),not(p)))),not(or(not(p),not(q))))) ),
inference(resolution,[],[f153,f19]) ).
fof(f265,definition,
( spl0_5
<=> theorem(or(not(not(or(not(q),not(p)))),not(or(not(p),not(q))))) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f267,plain,
( ~ theorem(or(not(not(or(not(q),not(p)))),not(or(not(p),not(q)))))
| spl0_5 ),
inference(avatar_component_clause,[],[f265]) ).
fof(f269,definition,
( spl0_6
<=> theorem(or(not(not(or(not(p),not(q)))),not(or(not(q),not(p))))) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f271,plain,
( ~ theorem(or(not(not(or(not(p),not(q)))),not(or(not(q),not(p)))))
| spl0_6 ),
inference(avatar_component_clause,[],[f269]) ).
fof(f272,plain,
( ~ spl0_5
| ~ spl0_6 ),
inference(avatar_split_clause,[],[f262,f269,f265]) ).
fof(f709,plain,
! [X2,X0,X1] :
( theorem(or(not(or(X0,X1)),or(X0,X2)))
| ~ theorem(or(not(X1),X2)) ),
inference(resolution,[],[f50,f18]) ).
fof(f1015,plain,
! [X2,X0,X1] :
( ~ theorem(or(not(X0),X1))
| theorem(or(X2,X1))
| ~ theorem(or(X2,X0)) ),
inference(resolution,[],[f709,f18]) ).
fof(f1673,plain,
! [X0,X1] :
( theorem(or(X0,not(not(X1))))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f1015,f113]) ).
fof(f1770,plain,
! [X0,X1] :
( theorem(or(not(not(X1)),X0))
| ~ theorem(or(X0,X1)) ),
inference(resolution,[],[f1673,f27]) ).
fof(f1858,plain,
( ~ theorem(or(not(or(not(p),not(q))),or(not(q),not(p))))
| spl0_5 ),
inference(resolution,[],[f1770,f267]) ).
fof(f1877,plain,
( $false
| spl0_5 ),
inference(forward_subsumption_resolution,[],[f1858,f26]) ).
fof(f1878,plain,
spl0_5,
inference(avatar_contradiction_clause,[],[f1877]) ).
fof(f1916,plain,
( ~ theorem(or(not(or(not(q),not(p))),or(not(p),not(q))))
| spl0_6 ),
inference(resolution,[],[f271,f1770]) ).
fof(f1920,plain,
( $false
| spl0_6 ),
inference(forward_subsumption_resolution,[],[f1916,f26]) ).
fof(f1921,plain,
spl0_6,
inference(avatar_contradiction_clause,[],[f1920]) ).
cnf(s12,plain,
( ~ spl0_5
| ~ spl0_6 ),
inference(sat_conversion,[],[f272]) ).
cnf(s14,plain,
spl0_5,
inference(sat_conversion,[],[f1878]) ).
cnf(s20,plain,
spl0_6,
inference(sat_conversion,[],[f1921]) ).
cnf(s21,plain,
$false,
inference(rat,[],[s12,s20,s14]) ).
fof(f1922,plain,
$false,
inference(avatar_sat_refutation,[],[s21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL273-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.40 % Computer : n005.cluster.edu
% 0.12/0.40 % Model : x86_64 x86_64
% 0.12/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.40 % Memory : 8046.5625MB
% 0.12/0.40 % OS : Linux 6.8.0-71-generic
% 0.12/0.40 % CPULimit : 300
% 0.12/0.40 % WCLimit : 300
% 0.12/0.40 % DateTime : Sun Sep 27 15:32:17 UTC 2026
% 0.12/0.40 % CPUTime :
% 0.12/0.40 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.43 Running first-order model finding
% 0.12/0.43 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.89/0.61 % (4145141)Will run a generic schedule for satisfiability detection.
% 0.89/0.61 % (4145149)dis+10_1_sil=32000:sp=arity:random_seed=3949211526:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.89/0.61 % (4145147)% WARNING: option uhcvi not known.
% 0.89/0.61 % (4145146)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2613144434_2999 on theBenchmark for (2999ds/0Mi)
% 0.89/0.61 % (4145147)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=492091281:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.89/0.61 % (4145148)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=289957894:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.89/0.61 % (4145150)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4203202284:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.89/0.61 % (4145151)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=124234961:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.89/0.61 % (4145152)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=913651591:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.89/0.61 % TRYING [1]
% 0.89/0.61 % TRYING [2]
% 0.89/0.61 % TRYING [3]
% 0.89/0.61 % TRYING [4]
% 0.89/0.61 % (4145149)Instruction limit reached!
% 0.89/0.61 % (4145149)------------------------------
% 0.89/0.61 % (4145149)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.89/0.61 % (4145149)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.89/0.61 % (4145149)CaDiCaL version: 2.1.3
% 0.89/0.61 % (4145149)Termination reason: Instruction limit
% 0.89/0.61 % (4145149)Termination phase: Saturation
% 0.89/0.61 % (4145149)Time elapsed: 0.036 s
% 0.89/0.61 % (4145149)Peak memory usage: 12 MB
% 0.89/0.61 % (4145149)Instructions burned: 105 (million)
% 0.89/0.61 % (4145160)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1496917214:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.89/0.61 % TRYING [1]
% 0.89/0.61 % TRYING [2]
% 0.89/0.61 % TRYING [3]
% 0.89/0.61 % TRYING [4]
% 0.89/0.61 % (4145150)Instruction limit reached!
% 0.89/0.61 % (4145150)------------------------------
% 0.89/0.61 % (4145150)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.89/0.61 % (4145150)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.89/0.61 % (4145150)CaDiCaL version: 2.1.3
% 0.89/0.61 % (4145150)Termination reason: Instruction limit
% 0.89/0.61 % (4145150)Termination phase: Saturation
% 0.89/0.61 % (4145150)Time elapsed: 0.054 s
% 0.89/0.61 % (4145150)Peak memory usage: 11 MB
% 0.89/0.61 % (4145150)Instructions burned: 117 (million)
% 0.89/0.61 % (4145162)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=274307398:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.89/0.61 % (4145151)Instruction limit reached!
% 0.89/0.61 % (4145151)------------------------------
% 0.89/0.61 % (4145151)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.89/0.61 % (4145151)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.89/0.61 % (4145151)CaDiCaL version: 2.1.3
% 0.89/0.61 % (4145151)Termination reason: Instruction limit
% 0.89/0.61 % (4145151)Termination phase: Saturation
% 0.89/0.61 % (4145151)Time elapsed: 0.081 s
% 0.89/0.61 % (4145151)Peak memory usage: 13 MB
% 0.89/0.61 % (4145151)Instructions burned: 133 (million)
% 0.89/0.61 % (4145152)Instruction limit reached!
% 0.89/0.61 % (4145152)------------------------------
% 0.89/0.61 % (4145152)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.89/0.61 % (4145152)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.89/0.61 % (4145152)CaDiCaL version: 2.1.3
% 0.89/0.61 % (4145152)Termination reason: Instruction limit
% 0.89/0.61 % (4145152)Termination phase: Saturation
% 0.89/0.61 % (4145152)Time elapsed: 0.096 s
% 0.89/0.61 % (4145152)Peak memory usage: 13 MB
% 0.89/0.61 % (4145152)Instructions burned: 161 (million)
% 0.89/0.61 % (4145164)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=1813325999:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 0.89/0.61 % (4145165)ott-21_1_sil=16000:fs=off:random_seed=1993272838:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 0.89/0.61 % (4145164) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4145141-4145164"...
% 0.89/0.61 % (4145164)...printing done.
% 0.89/0.61 % (4145164)Refutation found. Thanks to Tanya!
% 0.89/0.61 % SZS status Unsatisfiable for theBenchmark
% 0.89/0.61 % SZS output start Proof for theBenchmark
% See solution above
% 0.89/0.61 % (4145164)------------------------------
% 0.89/0.61 % (4145164)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.89/0.61 % (4145164)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.89/0.61 % (4145164)CaDiCaL version: 2.1.3
% 0.89/0.61 % (4145164)Termination reason: Refutation
% 0.89/0.61 % (4145164)Time elapsed: 0.030 s
% 0.89/0.61 % (4145164)Peak memory usage: 12 MB
% 0.89/0.61 % (4145164)Instructions burned: 52 (million)
% 0.89/0.61 % (4145141)Success in time 0.165 s
% 0.89/0.61 % Vampire exiting
%------------------------------------------------------------------------------