%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL110-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n014.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 : Fri Sep 25 02:05:40 PM UTC 2026
% Result : Unsatisfiable 1.92s 11.29s
% Output : CNFRefutation 1.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 45 ( 27 unt; 3 def)
% Number of atoms : 104 ( 3 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 51 ( 29 ~; 22 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 69 ( 0 sgn 69 !; 0 ?; 58 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f2,axiom,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv_1) ).
fof(f3,axiom,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv_2) ).
fof(f4,axiom,
! [X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X1),implies(implies(X1,X0),X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv_3) ).
fof(f5,axiom,
! [X0,X1] : is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv_5) ).
fof(f6,negated_conjecture,
~ is_a_theorem(implies(not(not(a)),a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_mv_24) ).
tcf(c_55,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(X0,implies(X1,X0))),
inference(cnf_transformation,[],[f2]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
inference(cnf_transformation,[],[f3]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(implies(implies(X0,X1),X1),implies(implies(X1,X0),X0))),
inference(cnf_transformation,[],[f4]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))),
inference(cnf_transformation,[],[f5]) ).
tcf(c_60,negated_conjecture,
~ is_a_theorem(implies(not(not(a)),a)),
inference(cnf_transformation,[],[f6]) ).
tcf(c_81,definition,
iPr_def_10 = not(a),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_82,definition,
iPr_def_11 = not(iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_83,definition,
iPr_def_12 = implies(iPr_def_11,a),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_84,negated_conjecture,
~ is_a_theorem(iPr_def_12),
inference(demodulation,[status(thm)],[c_60,c_81,c_82,c_83]) ).
tcf(c_189,plain,
is_a_theorem(implies(a,iPr_def_12)),
inference(superposition,[status(thm)],[c_83,c_56]) ).
tcf(c_193,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_56,c_55]) ).
tcf(c_208,plain,
! [X0: $i] : is_a_theorem(implies(implies(not(X0),iPr_def_11),implies(iPr_def_10,X0))),
inference(superposition,[status(thm)],[c_82,c_59]) ).
tcf(c_221,plain,
! [X0: $i] : is_a_theorem(implies(implies(iPr_def_11,X0),implies(implies(X0,a),iPr_def_12))),
inference(superposition,[status(thm)],[c_83,c_57]) ).
tcf(c_222,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(implies(X1,X2),implies(X0,X2)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(superposition,[status(thm)],[c_57,c_55]) ).
tcf(c_231,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(implies(X1,X0),X0))
| ~ is_a_theorem(implies(implies(X0,X1),X1)) ),
inference(superposition,[status(thm)],[c_58,c_55]) ).
tcf(c_447,plain,
! [X0: $i] :
( is_a_theorem(implies(implies(X0,a),iPr_def_12))
| ~ is_a_theorem(implies(iPr_def_11,X0)) ),
inference(superposition,[status(thm)],[c_221,c_55]) ).
tcf(c_532,plain,
! [X0: $i] :
( is_a_theorem(iPr_def_12)
| ~ is_a_theorem(implies(iPr_def_11,X0))
| ~ is_a_theorem(implies(X0,a)) ),
inference(superposition,[status(thm)],[c_447,c_55]) ).
tcf(c_533,plain,
! [X0: $i] :
( ~ is_a_theorem(implies(iPr_def_11,X0))
| ~ is_a_theorem(implies(X0,a)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_532,c_84]) ).
tcf(c_566,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(X0,X2))
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(superposition,[status(thm)],[c_222,c_55]) ).
tcf(c_597,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(implies(X0,X1),X1))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_193,c_231]) ).
tcf(c_613,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X0,X1),X2)) ),
inference(superposition,[status(thm)],[c_56,c_566]) ).
tcf(c_614,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(implies(implies(X2,X0),X3))
| ~ is_a_theorem(implies(implies(implies(X0,X1),implies(X2,X1)),X3)) ),
inference(superposition,[status(thm)],[c_57,c_566]) ).
tcf(c_616,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(implies(not(X1),not(X0)),X2))
| ~ is_a_theorem(implies(implies(X0,X1),X2)) ),
inference(superposition,[status(thm)],[c_59,c_566]) ).
tcf(c_617,plain,
! [X0: $i] :
( is_a_theorem(implies(a,X0))
| ~ is_a_theorem(implies(iPr_def_12,X0)) ),
inference(superposition,[status(thm)],[c_189,c_566]) ).
tcf(c_818,plain,
! [X0: $i] : is_a_theorem(implies(a,implies(X0,iPr_def_12))),
inference(superposition,[status(thm)],[c_56,c_617]) ).
tcf(c_956,plain,
! [X0: $i] : is_a_theorem(implies(iPr_def_11,implies(iPr_def_10,X0))),
inference(superposition,[status(thm)],[c_208,c_613]) ).
tcf(c_963,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(X1,X1))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_597,c_613]) ).
tcf(c_1250,plain,
! [X0: $i] : is_a_theorem(implies(X0,X0)),
inference(superposition,[status(thm)],[c_818,c_963]) ).
tcf(c_1316,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : is_a_theorem(implies(implies(X0,X1),implies(X2,implies(implies(X1,X3),implies(X0,X3))))),
inference(superposition,[status(thm)],[c_56,c_614]) ).
tcf(c_1410,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(implies(X0,iPr_def_11),implies(X1,implies(iPr_def_12,implies(X0,a))))),
inference(superposition,[status(thm)],[c_83,c_1316]) ).
tcf(c_1717,plain,
! [X0: $i] : is_a_theorem(implies(implies(iPr_def_11,iPr_def_11),implies(X0,implies(iPr_def_12,iPr_def_12)))),
inference(superposition,[status(thm)],[c_83,c_1410]) ).
tcf(c_1732,plain,
! [X0: $i] :
( is_a_theorem(implies(X0,implies(iPr_def_12,iPr_def_12)))
| ~ is_a_theorem(implies(iPr_def_11,iPr_def_11)) ),
inference(superposition,[status(thm)],[c_1717,c_55]) ).
tcf(c_1734,plain,
! [X0: $i] : is_a_theorem(implies(X0,implies(iPr_def_12,iPr_def_12))),
inference(forward_subsumption_resolution,[status(thm)],[c_1732,c_1250]) ).
tcf(c_1766,plain,
! [X0: $i] : is_a_theorem(implies(implies(implies(iPr_def_12,iPr_def_12),X0),X0)),
inference(superposition,[status(thm)],[c_1734,c_231]) ).
tcf(c_1912,plain,
! [X0: $i,X1: $i] :
( ~ is_a_theorem(implies(implies(X1,X0),a))
| ~ is_a_theorem(implies(iPr_def_11,implies(not(X0),not(X1)))) ),
inference(superposition,[status(thm)],[c_616,c_533]) ).
tcf(c_2278,plain,
! [X0: $i] :
( ~ is_a_theorem(implies(implies(X0,a),a))
| ~ is_a_theorem(implies(iPr_def_11,implies(iPr_def_10,not(X0)))) ),
inference(superposition,[status(thm)],[c_81,c_1912]) ).
tcf(c_2289,plain,
! [X0: $i] : ~ is_a_theorem(implies(implies(X0,a),a)),
inference(forward_subsumption_resolution,[status(thm)],[c_2278,c_956]) ).
tcf(c_2412,plain,
$false,
inference(superposition,[status(thm)],[c_1766,c_2289]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL110-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/10.38 % Computer : n014.cluster.edu
% 0.11/10.38 % Model : x86_64 x86_64
% 0.11/10.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.38 % Memory : 8046.5625MB
% 0.11/10.38 % OS : Linux 6.8.0-71-generic
% 0.11/10.38 % CPULimit : 300
% 0.11/10.38 % WCLimit : 300
% 0.11/10.38 % DateTime : Wed Sep 23 21:57:44 UTC 2026
% 0.11/10.38 % CPUTime :
% 0.11/10.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/10.42 Running first-order theorem proving
% 0.15/10.42 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/10.43
% 0.15/10.43 % ======== iProver multi-core TPTP/SMT =========
% 0.15/10.43
% 0.15/10.43 % Detected problem language: tptp
% 0.15/10.44 % Proving...
% 1.92/11.29 % SZS status Started for theBenchmark.p
% 1.92/11.29 % SZS status Unsatisfiable for theBenchmark.p
% 1.92/11.29
% 1.92/11.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.92/11.29
% 1.92/11.29 % ------ iProver source info
% 1.92/11.29
% 1.92/11.29 % git: date: 2026-07-19 20:42:38 +0200
% 1.92/11.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.92/11.29 % git: non_committed_changes: false
% 1.92/11.29
% 1.92/11.29 % ------ Parsing...% successful
% 1.92/11.29
% 1.92/11.29
% 1.92/11.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.92/11.29
% 1.92/11.29 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.92/11.29
% 1.92/11.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.92/11.29
% 1.92/11.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.92/11.29 % ------ Proving...
% 1.92/11.29 % ------ Problem Properties
% 1.92/11.29
% 1.92/11.29 %
% 1.92/11.29 % clauses 9
% 1.92/11.29 % conjectures 1
% 1.92/11.29 % EPR 1
% 1.92/11.29 % Horn 9
% 1.92/11.29 % unary 8
% 1.92/11.29 % binary 0
% 1.92/11.29 % lits 11
% 1.92/11.29 % lits eq 3
% 1.92/11.29 % fd_pure 0
% 1.92/11.29 % fd_pseudo 0
% 1.92/11.29 % fd_cond 0
% 1.92/11.29 % fd_pseudo_cond 0
% 1.92/11.29 % AC symbols 0
% 1.92/11.29
% 1.92/11.29 % ------ Schedule dynamic 5 is on
% 1.92/11.29
% 1.92/11.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.92/11.29
% 1.92/11.29
% 1.92/11.29 % ------
% 1.92/11.29 % Current options:
% 1.92/11.29 % ------
% 1.92/11.29
% 1.92/11.29
% 1.92/11.29 %
% 1.92/11.29
% 1.92/11.29 % ------ Proving...
% 1.92/11.29 %
% 1.92/11.29
% 1.92/11.29 % SZS status Unsatisfiable for theBenchmark.p
% 1.92/11.29
% 1.92/11.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.92/11.29
% 1.92/11.29
%------------------------------------------------------------------------------