%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL239-10 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n026.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:08 AM UTC 2026
% Result : Unsatisfiable 0.35s 0.73s
% Output : Refutation 0.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 10
% Syntax : Number of formulae : 48 ( 48 unt; 0 def)
% Number of atoms : 48 ( 47 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-4 aty)
% Number of variables : 78 ( 78 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : ifeq(X0,X0,X1,X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom) ).
fof(f2,axiom,
! [X0] : axiom(implies(or(X0,X0),X0)) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_2) ).
fof(f3,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_3) ).
fof(f4,plain,
! [X0,X1] : true = axiom(implies(X0,or(X1,X0))),
inference(reorient_equations,[],[f3]) ).
fof(f5,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_4) ).
fof(f6,plain,
! [X0,X1] : true = axiom(implies(or(X0,X1),or(X1,X0))),
inference(reorient_equations,[],[f5]) ).
fof(f9,axiom,
! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_6) ).
fof(f10,plain,
! [X2,X0,X1] : true = axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
inference(reorient_equations,[],[f9]) ).
fof(f11,axiom,
! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_definition) ).
fof(f12,axiom,
! [X0] : ifeq(axiom(X0),true,theorem(X0),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).
fof(f13,plain,
! [X0] : true = ifeq(axiom(X0),true,theorem(X0),true),
inference(reorient_equations,[],[f12]) ).
fof(f14,axiom,
! [X0,X1] : ifeq(theorem(implies(X0,X1)),true,ifeq(theorem(X0),true,theorem(X1),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_2) ).
fof(f15,plain,
! [X0,X1] : true = ifeq(theorem(implies(X0,X1)),true,ifeq(theorem(X0),true,theorem(X1),true),true),
inference(reorient_equations,[],[f14]) ).
fof(f16,axiom,
! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_defn) ).
fof(f17,negated_conjecture,
theorem(not(and(p,not(p)))) != true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f18,plain,
true != theorem(not(and(p,not(p)))),
inference(reorient_equations,[],[f17]) ).
fof(f19,plain,
! [X0] : true = axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f2,f11]) ).
fof(f20,plain,
! [X0,X1] : true = axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f4,f11]) ).
fof(f21,plain,
! [X0,X1] : true = axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f6,f11]) ).
fof(f23,plain,
! [X2,X0,X1] : true = axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(definition_unfolding,[],[f10,f11,f11,f11]) ).
fof(f24,plain,
! [X0,X1] : true = ifeq(theorem(or(not(X0),X1)),true,ifeq(theorem(X0),true,theorem(X1),true),true),
inference(definition_unfolding,[],[f15,f11]) ).
fof(f25,plain,
true != theorem(not(not(or(not(p),not(not(p)))))),
inference(definition_unfolding,[],[f18,f16]) ).
fof(f26,plain,
! [X0] : true = ifeq(true,true,theorem(or(not(or(X0,X0)),X0)),true),
inference(superposition,[],[f13,f19]) ).
fof(f27,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(X0),or(X1,X0))),true),
inference(superposition,[],[f13,f20]) ).
fof(f28,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(or(X0,X1)),or(X1,X0))),true),
inference(superposition,[],[f13,f21]) ).
fof(f30,plain,
! [X0] : true = theorem(or(not(or(X0,X0)),X0)),
inference(superposition,[],[f1,f26]) ).
fof(f34,plain,
! [X0,X1] : true = theorem(or(not(X0),or(X1,X0))),
inference(superposition,[],[f1,f27]) ).
fof(f41,plain,
! [X0,X1] : true = theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(superposition,[],[f1,f28]) ).
fof(f46,plain,
! [X2,X0,X1] : true = ifeq(true,true,theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),true),
inference(superposition,[],[f13,f23]) ).
fof(f48,plain,
! [X0,X1] : true = ifeq(true,true,ifeq(theorem(or(X0,X1)),true,theorem(or(X1,X0)),true),true),
inference(superposition,[],[f24,f41]) ).
fof(f50,plain,
! [X0,X1] : true = ifeq(theorem(or(not(or(not(or(X0,X0)),X0)),X1)),true,ifeq(true,true,theorem(X1),true),true),
inference(superposition,[],[f24,f30]) ).
fof(f52,plain,
! [X2,X0,X1] : true = ifeq(theorem(or(not(or(not(X0),or(X1,X0))),X2)),true,ifeq(true,true,theorem(X2),true),true),
inference(superposition,[],[f24,f34]) ).
fof(f182,plain,
! [X0,X1] : true = ifeq(theorem(or(X0,X1)),true,theorem(or(X1,X0)),true),
inference(superposition,[],[f1,f48]) ).
fof(f186,plain,
! [X2,X0,X1] : true = theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(superposition,[],[f1,f46]) ).
fof(f944,plain,
! [X0,X1] : true = ifeq(theorem(or(not(or(not(or(X1,X1)),X1)),X0)),true,theorem(X0),true),
inference(superposition,[],[f50,f1]) ).
fof(f983,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(or(X1,or(X0,X0))),or(X1,X0))),true),
inference(superposition,[],[f944,f186]) ).
fof(f1038,plain,
! [X0,X1] : true = theorem(or(not(or(X0,or(X1,X1))),or(X0,X1))),
inference(superposition,[],[f1,f983]) ).
fof(f1348,plain,
! [X0] : true = ifeq(true,true,ifeq(true,true,theorem(or(not(X0),X0)),true),true),
inference(superposition,[],[f52,f1038]) ).
fof(f1454,plain,
! [X0] : true = ifeq(true,true,theorem(or(not(X0),X0)),true),
inference(superposition,[],[f1,f1348]) ).
fof(f1473,plain,
! [X0] : true = theorem(or(not(X0),X0)),
inference(superposition,[],[f1,f1454]) ).
fof(f1483,plain,
! [X0] : true = ifeq(true,true,theorem(or(X0,not(X0))),true),
inference(superposition,[],[f182,f1473]) ).
fof(f1523,plain,
! [X0] : true = theorem(or(X0,not(X0))),
inference(superposition,[],[f1,f1483]) ).
fof(f1527,plain,
! [X0] : true = ifeq(true,true,ifeq(theorem(X0),true,theorem(not(not(X0))),true),true),
inference(superposition,[],[f24,f1523]) ).
fof(f2058,plain,
! [X0] : true = ifeq(theorem(X0),true,theorem(not(not(X0))),true),
inference(superposition,[],[f1,f1527]) ).
fof(f2082,plain,
! [X0] : true = ifeq(true,true,theorem(not(not(or(X0,not(X0))))),true),
inference(superposition,[],[f2058,f1523]) ).
fof(f2126,plain,
! [X0] : true = theorem(not(not(or(X0,not(X0))))),
inference(superposition,[],[f1,f2082]) ).
fof(f2127,plain,
true != true,
inference(superposition,[],[f25,f2126]) ).
fof(f2148,plain,
$false,
inference(trivial_inequality_removal,[],[f2127]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL239-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.07 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.21/0.47 % Computer : n026.cluster.edu
% 0.21/0.47 % Model : x86_64 x86_64
% 0.21/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.47 % Memory : 8046.5625MB
% 0.21/0.47 % OS : Linux 6.8.0-71-generic
% 0.21/0.47 % CPULimit : 300
% 0.21/0.47 % WCLimit : 300
% 0.21/0.47 % DateTime : Sun Sep 27 15:32:49 UTC 2026
% 0.21/0.48 % CPUTime :
% 0.21/0.48 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.25/0.53 Running first-order model finding
% 0.25/0.53 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.35/0.73 % (3004831)Will run a generic schedule for satisfiability detection.
% 0.35/0.73 % (3004839)dis+10_1_sil=32000:sp=arity:random_seed=2928915142:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.35/0.73 % (3004837)% WARNING: option uhcvi not known.
% 0.35/0.73 % (3004838)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4210266616:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.35/0.73 % (3004836)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1562676309_2999 on theBenchmark for (2999ds/0Mi)
% 0.35/0.73 % (3004837)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1051766165:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.35/0.73 % (3004841)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4098423210:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.35/0.73 % (3004840)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3803607776:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.35/0.73 % (3004842)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=723385100:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.35/0.73 % TRYING [1]
% 0.35/0.73 % TRYING [2]
% 0.35/0.73 % TRYING [3]
% 0.35/0.73 % TRYING [4]
% 0.35/0.73 % (3004839)Instruction limit reached!
% 0.35/0.73 % (3004839)------------------------------
% 0.35/0.73 % (3004839)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.35/0.73 % (3004839)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.35/0.73 % (3004839)CaDiCaL version: 2.1.3
% 0.35/0.73 % (3004839)Termination reason: Instruction limit
% 0.35/0.73 % (3004839)Termination phase: Saturation
% 0.35/0.73 % (3004839)Time elapsed: 0.051 s
% 0.35/0.73 % (3004839)Peak memory usage: 12 MB
% 0.35/0.73 % (3004839)Instructions burned: 103 (million)
% 0.35/0.73 % (3004850)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1681356050:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.35/0.73 % TRYING [1]
% 0.35/0.73 % TRYING [2]
% 0.35/0.73 % TRYING [3]
% 0.35/0.73 % TRYING [4]
% 0.35/0.73 % (3004840)Instruction limit reached!
% 0.35/0.73 % (3004840)------------------------------
% 0.35/0.73 % (3004840)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.35/0.73 % (3004840)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.35/0.73 % (3004840)CaDiCaL version: 2.1.3
% 0.35/0.73 % (3004840)Termination reason: Instruction limit
% 0.35/0.73 % (3004840)Termination phase: Saturation
% 0.35/0.73 % (3004840)Time elapsed: 0.113 s
% 0.35/0.73 % (3004840)Peak memory usage: 12 MB
% 0.35/0.73 % (3004840)Instructions burned: 116 (million)
% 0.35/0.73 % (3004841)Instruction limit reached!
% 0.35/0.73 % (3004841)------------------------------
% 0.35/0.73 % (3004841)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.35/0.73 % (3004841)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.35/0.73 % (3004841)CaDiCaL version: 2.1.3
% 0.35/0.73 % (3004841)Termination reason: Instruction limit
% 0.35/0.73 % (3004841)Termination phase: Saturation
% 0.35/0.73 % (3004841)Time elapsed: 0.123 s
% 0.35/0.73 % (3004841)Peak memory usage: 13 MB
% 0.35/0.73 % (3004841)Instructions burned: 132 (million)
% 0.35/0.73 % (3004842) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3004831-3004842"...
% 0.35/0.73 % (3004842)...printing done.
% 0.35/0.73 % (3004842)Refutation found. Thanks to Tanya!
% 0.35/0.73 % SZS status Unsatisfiable for theBenchmark
% 0.35/0.73 % SZS output start Proof for theBenchmark
% See solution above
% 0.35/0.73 % (3004842)------------------------------
% 0.35/0.73 % (3004842)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.35/0.73 % (3004842)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.35/0.73 % (3004842)CaDiCaL version: 2.1.3
% 0.35/0.73 % (3004842)Termination reason: Refutation
% 0.35/0.73 % (3004842)Time elapsed: 0.132 s
% 0.35/0.73 % (3004842)Peak memory usage: 12 MB
% 0.35/0.73 % (3004842)Instructions burned: 132 (million)
% 0.35/0.73 % (3004831)Success in time 0.181 s
% 0.35/0.73 % Vampire exiting
%------------------------------------------------------------------------------