%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL415-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n009.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:35 AM UTC 2026
% Result : Satisfiable 0.11s 0.46s
% Output : Saturation 0.11s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(u12,axiom,
( is_a_theorem(implies(implies(implies(X0,X1),X2),implies(implies(implies(implies(X0,X1),X2),implies(implies(X0,X1),X2)),implies(X1,X2))))
| ~ is_a_theorem(implies(implies(implies(X0,X1),X2),implies(X1,implies(implies(X0,X1),X2)))) ) ).
cnf(u5,axiom,
( ~ is_a_theorem(implies(X1,implies(implies(X2,X0),X3)))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(X0,X3)) ) ).
cnf(u15,axiom,
( is_a_theorem(implies(implies(implies(implies(X0,X1),X1),implies(implies(X0,X1),X1)),implies(X1,implies(implies(X0,X1),X1))))
| ~ is_a_theorem(implies(implies(implies(X0,X1),X1),implies(X1,implies(implies(X0,X1),X1))))
| ~ is_a_theorem(implies(implies(X0,X1),X1)) ) ).
cnf(u17,axiom,
( ~ is_a_theorem(implies(implies(implies(X0,X1),X2),implies(X1,implies(implies(X0,X1),X2))))
| ~ is_a_theorem(implies(implies(X0,X1),X2))
| ~ is_a_theorem(implies(implies(implies(X0,X1),X2),implies(implies(X0,X1),X2)))
| is_a_theorem(implies(X1,X2)) ) ).
cnf(u19,axiom,
( ~ is_a_theorem(implies(implies(implies(X0,implies(X1,X2)),implies(X1,X2)),implies(implies(X1,X2),implies(implies(X0,implies(X1,X2)),implies(X1,X2)))))
| ~ is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(X1,X2)))
| ~ is_a_theorem(implies(X2,implies(implies(implies(X0,implies(X1,X2)),implies(X1,X2)),implies(implies(X0,implies(X1,X2)),implies(X1,X2)))))
| is_a_theorem(implies(X2,implies(implies(X0,implies(X1,X2)),implies(X1,X2)))) ) ).
cnf(u4,axiom,
( is_a_theorem(implies(implies(X1,implies(implies(X2,X0),X3)),implies(X0,X3)))
| ~ is_a_theorem(implies(X0,X1)) ) ).
cnf(u14,axiom,
( is_a_theorem(implies(implies(implies(implies(X0,X1),X2),implies(implies(X0,X1),X2)),implies(X1,X2)))
| ~ is_a_theorem(implies(implies(X0,X1),X2))
| ~ is_a_theorem(implies(implies(implies(X0,X1),X2),implies(X1,implies(implies(X0,X1),X2)))) ) ).
cnf(u7,axiom,
( ~ is_a_theorem(implies(X0,implies(X1,implies(implies(X2,implies(X3,X0)),X4))))
| is_a_theorem(implies(X0,X4))
| ~ is_a_theorem(implies(implies(X3,X0),X1)) ) ).
cnf(u6,axiom,
( ~ is_a_theorem(implies(implies(implies(X0,X1),X2),implies(X1,X3)))
| is_a_theorem(implies(implies(implies(X0,X1),X2),implies(X1,X2))) ) ).
cnf(u8,axiom,
( is_a_theorem(implies(implies(implies(X0,X1),implies(implies(X2,X1),X3)),implies(X1,implies(implies(X2,X1),X3))))
| ~ is_a_theorem(implies(X1,implies(X0,X1))) ) ).
cnf(condensed_detachment,axiom,
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ) ).
cnf(u11,axiom,
( ~ is_a_theorem(implies(implies(X1,X0),implies(implies(X2,X0),X3)))
| ~ is_a_theorem(implies(X0,implies(X1,X0)))
| is_a_theorem(implies(X0,implies(implies(X2,X0),X3))) ) ).
cnf(u10,axiom,
( ~ is_a_theorem(implies(X1,implies(implies(X2,implies(X0,X1)),implies(implies(X3,implies(X0,X1)),X4))))
| ~ is_a_theorem(implies(implies(X0,X1),implies(X2,implies(X0,X1))))
| is_a_theorem(implies(X1,implies(implies(X3,implies(X0,X1)),X4))) ) ).
cnf(prove_required_property,negated_conjecture,
~ is_a_theorem(implies(a,implies(b,a))) ).
cnf(candidate,axiom,
is_a_theorem(implies(implies(X0,X1),implies(implies(X1,implies(implies(X2,X0),X3)),implies(X0,X3)))) ).
cnf(u16,axiom,
( ~ is_a_theorem(implies(implies(implies(X0,implies(X1,X2)),X3),implies(implies(X1,X2),implies(implies(X0,implies(X1,X2)),X3))))
| ~ is_a_theorem(implies(implies(X0,implies(X1,X2)),X3))
| ~ is_a_theorem(implies(X2,implies(implies(implies(X0,implies(X1,X2)),X3),implies(implies(X0,implies(X1,X2)),X3))))
| is_a_theorem(implies(X2,X3)) ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL415-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n009.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 15:40:45 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 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.11/0.46 % (2194701)Will run a generic schedule for satisfiability detection.
% 0.11/0.46 % (2194709)dis+10_1_sil=32000:sp=arity:random_seed=1141102468:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.46 % (2194709) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2194701-2194709"...
% 0.11/0.46 % (2194709)...printing done.
% 0.11/0.46 % SZS status Satisfiable for theBenchmark
% 0.11/0.46 % SZS output start Saturation.
% See solution above
% 0.11/0.46 % SZS output start Definitions and Model Updates.
% 0.11/0.46 % SZS output end Definitions and Model Updates.
% 0.11/0.46 % (2194709)------------------------------
% 0.11/0.46 % (2194709)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.46 % (2194709)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.46 % (2194709)CaDiCaL version: 2.1.3
% 0.11/0.46 % (2194709)Termination reason: Satisfiable
% 0.11/0.46 % (2194709)Time elapsed: 0.001 s
% 0.11/0.46 % (2194709)Peak memory usage: 11 MB
% 0.11/0.46 % (2194709)Instructions burned: 2 (million)
% 0.11/0.46 % (2194701)Success in time 0.035 s
% 0.11/0.46 % Vampire exiting
%------------------------------------------------------------------------------