%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL033-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 : n001.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:28 PM UTC 2026
% Result : Unsatisfiable 0.45s 1.29s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 18 unt; 2 def)
% Number of atoms : 55 ( 2 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 20 ( 12 ~; 8 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 6 ( 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 : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 50 ( 0 sgn 50 !; 0 ?; 43 :)
% 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,X4] : is_a_theorem(implies(implies(implies(implies(implies(X0,X1),implies(X2,falsehood)),X3),X4),implies(implies(X4,X0),implies(X2,X0)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c0_CAMeredith) ).
fof(f3,negated_conjecture,
~ is_a_theorem(implies(a,implies(b,a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_c0_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,X4: $i] : is_a_theorem(implies(implies(implies(implies(implies(X0,X1),implies(X2,falsehood)),X3),X4),implies(implies(X4,X0),implies(X2,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,X2: $i] : is_a_theorem(implies(implies(implies(implies(iPr_def_11,implies(X0,falsehood)),X1),X2),implies(implies(X2,a),implies(X0,a)))),
inference(superposition,[status(thm)],[c_67,c_53]) ).
tcf(c_166,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(implies(implies(implies(implies(implies(iPr_def_10,X0),implies(a,falsehood)),X1),X2),implies(implies(X2,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,X4: $i] :
( is_a_theorem(implies(implies(X4,X0),implies(X2,X0)))
| ~ is_a_theorem(implies(implies(implies(implies(X0,X1),implies(X2,falsehood)),X3),X4)) ),
inference(superposition,[status(thm)],[c_53,c_52]) ).
tcf(c_182,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(implies(implies(implies(iPr_def_11,implies(b,falsehood)),X0),X1),implies(implies(X1,a),iPr_def_10))),
inference(superposition,[status(thm)],[c_66,c_162]) ).
tcf(c_301,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(implies(X2,iPr_def_10),iPr_def_11))
| ~ is_a_theorem(implies(implies(implies(implies(iPr_def_10,X0),implies(a,falsehood)),X1),X2)) ),
inference(superposition,[status(thm)],[c_166,c_52]) ).
tcf(c_322,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_330,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_374,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : is_a_theorem(implies(implies(implies(X0,implies(falsehood,X1)),X2),implies(X3,X2))),
inference(superposition,[status(thm)],[c_322,c_167]) ).
tcf(c_476,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(X1,iPr_def_11))
| ~ is_a_theorem(implies(implies(implies(X0,a),iPr_def_10),iPr_def_11)) ),
inference(superposition,[status(thm)],[c_330,c_52]) ).
tcf(c_543,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(falsehood,X2))),
inference(superposition,[status(thm)],[c_374,c_167]) ).
tcf(c_574,plain,
! [X0: $i] : is_a_theorem(implies(implies(implies(falsehood,X0),iPr_def_10),iPr_def_11)),
inference(superposition,[status(thm)],[c_543,c_301]) ).
tcf(c_610,plain,
! [X0: $i] : is_a_theorem(implies(X0,iPr_def_11)),
inference(superposition,[status(thm)],[c_574,c_476]) ).
tcf(c_612,plain,
! [X0: $i] :
( is_a_theorem(iPr_def_11)
| ~ is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_610,c_52]) ).
tcf(c_620,plain,
! [X0: $i] : ~ is_a_theorem(X0),
inference(forward_subsumption_resolution,[status(thm)],[c_612,c_68]) ).
tcf(c_621,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_610,c_620]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL033-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/0.37 % Computer : n001.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Wed Sep 23 21:46:20 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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.11/0.42
% 0.11/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.42
% 0.11/0.43 % Detected problem language: tptp
% 0.11/0.44 % Proving...
% 0.45/1.29 % SZS status Started for theBenchmark.p
% 0.45/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 0.45/1.29
% 0.45/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.45/1.29
% 0.45/1.29 % ------ iProver source info
% 0.45/1.29
% 0.45/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 0.45/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.45/1.29 % git: non_committed_changes: false
% 0.45/1.29
% 0.45/1.29 % ------ Parsing...% successful
% 0.45/1.29
% 0.45/1.29
% 0.45/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.45/1.29
% 0.45/1.29 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 0.45/1.29
% 0.45/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.45/1.29
% 0.45/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.45/1.29 % ------ Proving...
% 0.45/1.29 % ------ Problem Properties
% 0.45/1.29
% 0.45/1.29 %
% 0.45/1.29 % clauses 5
% 0.45/1.29 % conjectures 1
% 0.45/1.29 % EPR 1
% 0.45/1.29 % Horn 5
% 0.45/1.29 % unary 4
% 0.45/1.29 % binary 0
% 0.45/1.29 % lits 7
% 0.45/1.29 % lits eq 2
% 0.45/1.29 % fd_pure 0
% 0.45/1.29 % fd_pseudo 0
% 0.45/1.29 % fd_cond 0
% 0.45/1.29 % fd_pseudo_cond 0
% 0.45/1.29 % AC symbols 0
% 0.45/1.29
% 0.45/1.29 % ------ Schedule dynamic 5 is on
% 0.45/1.29
% 0.45/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.45/1.29
% 0.45/1.29
% 0.45/1.29 % ------
% 0.45/1.29 % Current options:
% 0.45/1.29 % ------
% 0.45/1.29
% 0.45/1.29
% 0.45/1.29 %
% 0.45/1.29
% 0.45/1.29 % ------ Proving...
% 0.45/1.29 %
% 0.45/1.29
% 0.45/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 0.45/1.29
% 0.45/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.45/1.29
% 0.45/1.29
%------------------------------------------------------------------------------