%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL108-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:51:12 AM UTC 2026
% Result : Unsatisfiable 5.99s 2.12s
% Output : Refutation 5.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 27 ( 16 unt; 0 def)
% Number of atoms : 40 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 30 ( 17 ~; 13 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 7 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 124 ( 124 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f2,axiom,
! [X2,X3,X0,X1,X6,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,X4),equivalent(equivalent(equivalent(X5,X4),equivalent(X5,X3)),X6))),equivalent(X2,equivalent(equivalent(X1,X0),X6)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lg_27_1690) ).
fof(f3,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(equivalent(b,a),c)),c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_q_3) ).
fof(f4,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,X4),equivalent(equivalent(equivalent(X5,X4),equivalent(X5,X3)),X6))))
| is_a_theorem(equivalent(X2,equivalent(equivalent(X1,X0),X6))) ),
inference(resolution,[],[f2,f1]) ).
fof(f5,plain,
! [X2,X3,X0,X1,X6,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(equivalent(X2,X1),equivalent(X2,X0)),X3)),equivalent(equivalent(equivalent(X4,X5),equivalent(equivalent(X6,X4),equivalent(X6,X5))),X3))),
inference(resolution,[],[f4,f2]) ).
fof(f6,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(equivalent(equivalent(X3,equivalent(equivalent(X4,X5),equivalent(X4,X6))),equivalent(X3,equivalent(X5,X6))),X7)),equivalent(equivalent(X1,X2),X7))),
inference(resolution,[],[f5,f4]) ).
fof(f18,plain,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X1,X3))),equivalent(X0,equivalent(X2,X3))),equivalent(equivalent(equivalent(X4,X5),equivalent(X4,X6)),X7)),equivalent(equivalent(equivalent(X8,X5),equivalent(X8,X6)),X7))),
inference(resolution,[],[f6,f4]) ).
fof(f19,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(equivalent(equivalent(X3,equivalent(equivalent(X4,X5),equivalent(X4,X6))),equivalent(X3,equivalent(X5,X6))),X7)))
| is_a_theorem(equivalent(equivalent(X1,X2),X7)) ),
inference(resolution,[],[f6,f1]) ).
fof(f20,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X1,X3))),equivalent(X0,equivalent(X2,X3))),equivalent(equivalent(equivalent(X4,X5),equivalent(X4,X6)),X7)),equivalent(equivalent(X5,X6),X7))),
inference(resolution,[],[f19,f2]) ).
fof(f21,plain,
! [X2,X3,X0,X1,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X1,equivalent(X2,X4)))),equivalent(X0,equivalent(X3,X4))),X5),X5)),
inference(resolution,[],[f19,f6]) ).
fof(f24,plain,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X1,X3))),equivalent(X0,equivalent(X2,X3))),equivalent(equivalent(equivalent(X4,X5),equivalent(X4,X6)),X7)))
| is_a_theorem(equivalent(equivalent(equivalent(X8,X5),equivalent(X8,X6)),X7)) ),
inference(resolution,[],[f18,f1]) ).
fof(f31,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X1,equivalent(X2,X4)))),equivalent(X0,equivalent(X3,X4))),X5))
| is_a_theorem(X5) ),
inference(resolution,[],[f21,f1]) ).
fof(f42,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X1,X3))),equivalent(X0,equivalent(X2,X3))),equivalent(equivalent(equivalent(X4,X5),equivalent(X4,X6)),X7)))
| is_a_theorem(equivalent(equivalent(X5,X6),X7)) ),
inference(resolution,[],[f20,f1]) ).
fof(f46,plain,
! [X2,X3,X0,X1,X4] : is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X0,X3)),equivalent(equivalent(equivalent(X4,X1),equivalent(X4,X2)),X3))),
inference(resolution,[],[f24,f6]) ).
fof(f47,plain,
! [X2,X3,X0,X1,X4] : is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X1,X3))),equivalent(X0,X4)),equivalent(equivalent(X2,X3),X4))),
inference(resolution,[],[f24,f2]) ).
fof(f52,plain,
! [X2,X3,X0,X1,X4] :
( is_a_theorem(equivalent(equivalent(equivalent(X4,X1),equivalent(X4,X2)),X3))
| ~ is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X0,X3))) ),
inference(resolution,[],[f46,f1]) ).
fof(f67,plain,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2))),
inference(resolution,[],[f47,f31]) ).
fof(f73,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X2)))
| is_a_theorem(equivalent(X1,X2)) ),
inference(resolution,[],[f67,f1]) ).
fof(f89,plain,
! [X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X0),X1),X1)),
inference(resolution,[],[f73,f46]) ).
fof(f99,plain,
! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(equivalent(X3,X0),equivalent(X3,X1)),X2))),
inference(resolution,[],[f42,f6]) ).
fof(f101,plain,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X0),equivalent(X2,X1)))),
inference(resolution,[],[f42,f47]) ).
fof(f158,plain,
! [X2,X0,X1] :
( is_a_theorem(equivalent(equivalent(X2,X0),equivalent(X2,X1)))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(resolution,[],[f101,f1]) ).
fof(f168,plain,
! [X2,X0,X1] :
( is_a_theorem(equivalent(X2,X1))
| ~ is_a_theorem(equivalent(X2,X0))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(resolution,[],[f158,f1]) ).
fof(f177,plain,
! [X0] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(equivalent(b,a),c)),X0))
| ~ is_a_theorem(equivalent(X0,c)) ),
inference(resolution,[],[f168,f3]) ).
fof(f203,plain,
! [X0] : ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,a),equivalent(X0,b)),equivalent(equivalent(b,a),c)),c)),
inference(resolution,[],[f99,f177]) ).
fof(f237,plain,
! [X0] : ~ is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(b,b),c)),equivalent(X0,c))),
inference(resolution,[],[f52,f203]) ).
fof(f249,plain,
$false,
inference(resolution,[],[f237,f89]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL108-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.42 % Computer : n015.cluster.edu
% 0.19/0.42 % Model : x86_64 x86_64
% 0.19/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.42 % Memory : 8046.5625MB
% 0.19/0.42 % OS : Linux 6.8.0-71-generic
% 0.19/0.43 % CPULimit : 300
% 0.19/0.43 % WCLimit : 300
% 0.19/0.43 % DateTime : Sun Sep 27 15:25:16 UTC 2026
% 0.19/0.43 % CPUTime :
% 0.19/0.43 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.49 Running first-order theorem proving
% 0.25/0.49 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.99/2.12 % (1777189)Input is clausal, will run a generic CNF schedule.
% 5.99/2.12 % (1777200)dis-21_1_sil=8000:lcm=predicate:random_seed=699397390: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)
% 5.99/2.12 % (1777200)Instruction limit reached!
% 5.99/2.12 % (1777200)------------------------------
% 5.99/2.12 % (1777200)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.99/2.12 % (1777200)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.99/2.12 % (1777200)CaDiCaL version: 2.1.3
% 5.99/2.12 % (1777200)Termination reason: Instruction limit
% 5.99/2.12 % (1777200)Termination phase: Saturation
% 5.99/2.12 % (1777200)Time elapsed: 0.055 s
% 5.99/2.12 % (1777200)Peak memory usage: 88 MB
% 5.99/2.12 % (1777200)Instructions burned: 117 (million)
% 5.99/2.12 % (1777196)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=641058365:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 5.99/2.12 % (1777195)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=30332107:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 5.99/2.12 % (1777198)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=193549674:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 5.99/2.12 % (1777194)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=4256763715:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 5.99/2.12 % (1777198)First to succeed.
% 5.99/2.12 % (1777198)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1777189"
% 5.99/2.12 % (1777197)lrs+10_1_sil=8000:sp=occurrence:random_seed=939557023:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 5.99/2.12 % (1777199)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3926673422:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 5.99/2.12 % (1777197)Also succeeded, but the first one will report.
% 5.99/2.12 % (1777206)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=2362973615:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 5.99/2.12 % (1777206)Refutation not found, incomplete strategy
% 5.99/2.12 % (1777206)------------------------------
% 5.99/2.12 % (1777206)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.99/2.12 % (1777206)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.99/2.12 % (1777206)CaDiCaL version: 2.1.3
% 5.99/2.12 % (1777206)Termination reason: Refutation not found, incomplete strategy
% 5.99/2.12 % (1777206)Time elapsed: 0.001 s
% 5.99/2.12 % (1777206)Peak memory usage: 87 MB
% 5.99/2.12 % (1777199)Instruction limit reached!
% 5.99/2.12 % (1777199)------------------------------
% 5.99/2.12 % (1777199)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.99/2.12 % (1777199)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.99/2.12 % (1777199)CaDiCaL version: 2.1.3
% 5.99/2.12 % (1777199)Termination reason: Instruction limit
% 5.99/2.12 % (1777199)Termination phase: Saturation
% 5.99/2.12 % (1777199)Time elapsed: 0.192 s
% 5.99/2.12 % (1777199)Peak memory usage: 89 MB
% 5.99/2.12 % (1777199)Instructions burned: 180 (million)
% 5.99/2.12 % (1777198)Refutation found. Thanks to Tanya!
% 5.99/2.12 % SZS status Unsatisfiable for theBenchmark
% 5.99/2.12 % SZS output start Proof for theBenchmark
% See solution above
% 5.99/2.12 % (1777198)------------------------------
% 5.99/2.12 % (1777198)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.99/2.12 % (1777198)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.99/2.12 % (1777198)CaDiCaL version: 2.1.3
% 5.99/2.12 % (1777198)Termination reason: Refutation
% 5.99/2.12 % (1777198)Time elapsed: 0.018 s
% 5.99/2.12 % (1777198)Peak memory usage: 88 MB
% 5.99/2.12 % (1777198)Instructions burned: 15 (million)
% 5.99/2.12 % (1777198)------------------------------
% 5.99/2.12 % (1777198)------------------------------
% 5.99/2.12 % (1777189)Success in time 0.719 s
% 5.99/2.12 % Vampire exiting
%------------------------------------------------------------------------------