%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL082-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 : n012.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:36 PM UTC 2026
% Result : Unsatisfiable 2.04s 6.08s
% Output : CNFRefutation 2.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 5
% Syntax : Number of formulae : 42 ( 25 unt; 2 def)
% Number of atoms : 129 ( 2 equ)
% Maximal formula atoms : 3 ( 3 avg)
% Number of connectives : 46 ( 25 ~; 21 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 71 ( 0 sgn 71 !; 0 ?; 65 :)
% 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,
! [X2,X3,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(implies(X2,X0),implies(X3,X0)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ic_JLukasiewicz) ).
fof(f3,negated_conjecture,
~ is_a_theorem(implies(a,implies(b,a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ic_2) ).
tcf(c_52,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_53,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(implies(X2,X0),implies(X3,X0)))),
inference(cnf_transformation,[],[f2]) ).
tcf(c_54,negated_conjecture,
~ is_a_theorem(implies(a,implies(b,a))),
inference(cnf_transformation,[],[f3]) ).
tcf(c_66,definition,
iPr_def_10 = implies(b,a),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_67,definition,
iPr_def_11 = implies(a,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_68,negated_conjecture,
~ is_a_theorem(iPr_def_11),
inference(demodulation,[status(thm)],[c_54,c_66,c_67]) ).
tcf(c_162,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(implies(iPr_def_11,X0),implies(implies(X0,a),implies(X1,a)))),
inference(superposition,[status(thm)],[c_67,c_53]) ).
tcf(c_164,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(implies(implies(iPr_def_10,X0),a),implies(iPr_def_11,implies(X1,iPr_def_10)))),
inference(superposition,[status(thm)],[c_67,c_53]) ).
tcf(c_166,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(implies(implies(iPr_def_10,X0),X1),implies(implies(X1,iPr_def_10),iPr_def_11))),
inference(superposition,[status(thm)],[c_67,c_53]) ).
tcf(c_167,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(implies(implies(X2,X0),implies(X3,X0)))
| ~ is_a_theorem(implies(implies(X0,X1),X2)) ),
inference(superposition,[status(thm)],[c_53,c_52]) ).
tcf(c_182,plain,
! [X0: $i] : is_a_theorem(implies(implies(iPr_def_11,X0),implies(implies(X0,a),iPr_def_10))),
inference(superposition,[status(thm)],[c_66,c_162]) ).
tcf(c_183,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(implies(X0,a),implies(X1,a)))
| ~ is_a_theorem(implies(iPr_def_11,X0)) ),
inference(superposition,[status(thm)],[c_162,c_52]) ).
tcf(c_224,plain,
! [X0: $i] :
( is_a_theorem(implies(implies(X0,a),iPr_def_10))
| ~ is_a_theorem(implies(iPr_def_11,X0)) ),
inference(superposition,[status(thm)],[c_182,c_52]) ).
tcf(c_281,plain,
! [X0: $i] : is_a_theorem(implies(implies(implies(iPr_def_10,X0),a),implies(iPr_def_11,iPr_def_11))),
inference(superposition,[status(thm)],[c_67,c_164]) ).
tcf(c_352,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : is_a_theorem(implies(implies(implies(implies(X0,X1),implies(X2,X1)),implies(X1,X3)),implies(X4,implies(X1,X3)))),
inference(superposition,[status(thm)],[c_53,c_167]) ).
tcf(c_358,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(implies(implies(implies(implies(X0,iPr_def_10),iPr_def_11),implies(iPr_def_10,X1)),implies(X2,implies(iPr_def_10,X1)))),
inference(superposition,[status(thm)],[c_166,c_167]) ).
tcf(c_361,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(implies(implies(implies(X0,a),iPr_def_10),iPr_def_11),implies(X1,iPr_def_11))),
inference(superposition,[status(thm)],[c_182,c_167]) ).
tcf(c_364,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(implies(iPr_def_10,X0),implies(X1,X0)))
| ~ is_a_theorem(implies(iPr_def_11,X0)) ),
inference(superposition,[status(thm)],[c_224,c_167]) ).
tcf(c_411,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(implies(implies(X1,a),X0),implies(X2,X0)))
| ~ is_a_theorem(implies(iPr_def_11,X0)) ),
inference(superposition,[status(thm)],[c_183,c_167]) ).
tcf(c_635,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(implies(iPr_def_11,X0))
| ~ is_a_theorem(implies(iPr_def_10,X0)) ),
inference(superposition,[status(thm)],[c_364,c_52]) ).
tcf(c_797,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( is_a_theorem(implies(X4,implies(X1,X3)))
| ~ is_a_theorem(implies(implies(implies(X0,X1),implies(X2,X1)),implies(X1,X3))) ),
inference(superposition,[status(thm)],[c_352,c_52]) ).
tcf(c_888,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(implies(iPr_def_11,X1))
| ~ is_a_theorem(implies(implies(X0,a),X1)) ),
inference(superposition,[status(thm)],[c_411,c_52]) ).
tcf(c_1076,plain,
! [X0: $i] :
( is_a_theorem(implies(X0,implies(iPr_def_11,iPr_def_11)))
| ~ is_a_theorem(implies(iPr_def_11,implies(iPr_def_11,iPr_def_11))) ),
inference(superposition,[status(thm)],[c_281,c_888]) ).
tcf(c_1174,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(X2,implies(iPr_def_10,X1)))
| ~ is_a_theorem(implies(implies(implies(X0,iPr_def_10),iPr_def_11),implies(iPr_def_10,X1))) ),
inference(superposition,[status(thm)],[c_358,c_52]) ).
tcf(c_1389,plain,
! [X0: $i] : is_a_theorem(implies(X0,implies(iPr_def_10,iPr_def_11))),
inference(superposition,[status(thm)],[c_361,c_1174]) ).
tcf(c_1393,plain,
! [X0: $i] :
( is_a_theorem(implies(iPr_def_10,iPr_def_11))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_1389,c_52]) ).
tcf(c_1394,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(implies(implies(iPr_def_10,iPr_def_11),X0),implies(X1,X0))),
inference(superposition,[status(thm)],[c_1389,c_167]) ).
tcf(c_1509,plain,
is_a_theorem(implies(iPr_def_10,iPr_def_11)),
inference(superposition,[status(thm)],[c_1389,c_1393]) ).
tcf(c_1511,plain,
! [X0: $i] :
( is_a_theorem(implies(X0,iPr_def_11))
| ~ is_a_theorem(implies(iPr_def_11,iPr_def_11)) ),
inference(superposition,[status(thm)],[c_1509,c_635]) ).
tcf(c_1848,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(X0,implies(iPr_def_11,implies(X1,iPr_def_11)))),
inference(superposition,[status(thm)],[c_1394,c_797]) ).
tcf(c_1883,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(iPr_def_11,implies(X1,iPr_def_11)))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_1848,c_52]) ).
tcf(c_2011,plain,
! [X0: $i] : is_a_theorem(implies(iPr_def_11,implies(X0,iPr_def_11))),
inference(superposition,[status(thm)],[c_1389,c_1883]) ).
tcf(c_2022,plain,
! [X0: $i] : is_a_theorem(implies(X0,implies(iPr_def_11,iPr_def_11))),
inference(backward_subsumption_resolution,[status(thm)],[c_1076,c_2011]) ).
tcf(c_2028,plain,
! [X0: $i] :
( is_a_theorem(implies(iPr_def_11,iPr_def_11))
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_2022,c_52]) ).
tcf(c_2095,plain,
is_a_theorem(implies(iPr_def_11,iPr_def_11)),
inference(superposition,[status(thm)],[c_1389,c_2028]) ).
tcf(c_2107,plain,
! [X0: $i] : is_a_theorem(implies(X0,iPr_def_11)),
inference(backward_subsumption_resolution,[status(thm)],[c_1511,c_2095]) ).
tcf(c_2111,plain,
! [X0: $i] :
( is_a_theorem(iPr_def_11)
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_2107,c_52]) ).
tcf(c_2120,plain,
! [X0: $i] : ~ is_a_theorem(X0),
inference(forward_subsumption_resolution,[status(thm)],[c_2111,c_68]) ).
tcf(c_2121,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_2107,c_2120]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : LCL082-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.03/5.32 % Computer : n012.cluster.edu
% 0.03/5.32 % Model : x86_64 x86_64
% 0.03/5.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/5.32 % Memory : 8046.5625MB
% 0.03/5.32 % OS : Linux 6.8.0-71-generic
% 0.03/5.32 % CPULimit : 300
% 0.03/5.32 % WCLimit : 300
% 0.03/5.32 % DateTime : Wed Sep 23 21:51:11 UTC 2026
% 0.03/5.32 % CPUTime :
% 0.03/5.32 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.03/5.34 Running first-order theorem proving
% 0.03/5.34 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.03/5.35
% 0.03/5.35 % ======== iProver multi-core TPTP/SMT =========
% 0.03/5.35
% 0.03/5.35 % Detected problem language: tptp
% 0.03/5.36 % Proving...
% 2.04/6.08 % SZS status Started for theBenchmark.p
% 2.04/6.08 % SZS status Unsatisfiable for theBenchmark.p
% 2.04/6.08
% 2.04/6.08 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.04/6.08
% 2.04/6.08 % ------ iProver source info
% 2.04/6.08
% 2.04/6.08 % git: date: 2026-07-19 20:42:38 +0200
% 2.04/6.08 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.04/6.08 % git: non_committed_changes: false
% 2.04/6.08
% 2.04/6.08 % ------ Parsing...% successful
% 2.04/6.08
% 2.04/6.08
% 2.04/6.08 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.04/6.08
% 2.04/6.08 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.04/6.08
% 2.04/6.08 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.04/6.08
% 2.04/6.08 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.04/6.08 % ------ Proving...
% 2.04/6.08 % ------ Problem Properties
% 2.04/6.08
% 2.04/6.08 %
% 2.04/6.08 % clauses 5
% 2.04/6.08 % conjectures 1
% 2.04/6.08 % EPR 1
% 2.04/6.08 % Horn 5
% 2.04/6.08 % unary 4
% 2.04/6.08 % binary 0
% 2.04/6.08 % lits 7
% 2.04/6.08 % lits eq 2
% 2.04/6.08 % fd_pure 0
% 2.04/6.08 % fd_pseudo 0
% 2.04/6.08 % fd_cond 0
% 2.04/6.08 % fd_pseudo_cond 0
% 2.04/6.08 % AC symbols 0
% 2.04/6.08
% 2.04/6.08 % ------ Schedule dynamic 5 is on
% 2.04/6.08
% 2.04/6.08 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.04/6.08
% 2.04/6.08
% 2.04/6.08 % ------
% 2.04/6.08 % Current options:
% 2.04/6.08 % ------
% 2.04/6.08
% 2.04/6.08
% 2.04/6.08 %
% 2.04/6.08
% 2.04/6.08 % ------ Proving...
% 2.04/6.08 %
% 2.04/6.08
% 2.04/6.08 % SZS status Unsatisfiable for theBenchmark.p
% 2.04/6.08
% 2.04/6.08 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.04/6.09
% 2.04/6.09
%------------------------------------------------------------------------------