%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL110-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n008.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:41 PM UTC 2026
% Result : Unsatisfiable 1.35s 1.18s
% Output : CNFRefutation 1.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 5
% Syntax : Number of formulae : 39 ( 39 unt; 0 def)
% Number of atoms : 39 ( 38 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 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 : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 57 ( 0 sgn 57 !; 0 ?; 44 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : implies(truth,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_1) ).
fof(f2,axiom,
! [X2,X0,X1] : implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))) = truth,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_2) ).
fof(f3,plain,
! [X2,X0,X1] : truth = implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))),
inference(reorient_equations,[],[f2]) ).
fof(f4,axiom,
! [X0,X1] : implies(implies(X0,X1),X1) = implies(implies(X1,X0),X0),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_3) ).
fof(f5,axiom,
! [X0,X1] : implies(implies(not(X0),not(X1)),implies(X1,X0)) = truth,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_4) ).
fof(f6,plain,
! [X0,X1] : truth = implies(implies(not(X0),not(X1)),implies(X1,X0)),
inference(reorient_equations,[],[f5]) ).
fof(f7,negated_conjecture,
implies(not(not(x)),x) != truth,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_mv_24) ).
fof(f8,plain,
truth != implies(not(not(x)),x),
inference(reorient_equations,[],[f7]) ).
tcf(c_54,plain,
! [X0: $i] : implies(truth,X0) = X0,
inference(cnf_transformation,[],[f1]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i,X2: $i] : implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))) = truth,
inference(cnf_transformation,[],[f3]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] : implies(implies(X0,X1),X1) = implies(implies(X1,X0),X0),
inference(cnf_transformation,[],[f4]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] : implies(implies(not(X0),not(X1)),implies(X1,X0)) = truth,
inference(cnf_transformation,[],[f6]) ).
tcf(c_58,negated_conjecture,
implies(not(not(x)),x) != truth,
inference(cnf_transformation,[],[f8]) ).
tcf(c_112,plain,
! [X0: $i] : implies(implies(X0,truth),truth) = implies(X0,X0),
inference(superposition,[status(thm)],[c_54,c_56]) ).
tcf(c_127,plain,
! [X0: $i] : implies(implies(not(X0),not(truth)),X0) = truth,
inference(superposition,[status(thm)],[c_54,c_57]) ).
tcf(c_203,plain,
! [X0: $i,X1: $i] : implies(implies(truth,X0),implies(implies(X0,X1),X1)) = truth,
inference(superposition,[status(thm)],[c_54,c_55]) ).
tcf(c_220,plain,
! [X0: $i,X1: $i] : implies(X0,implies(implies(X0,X1),X1)) = truth,
inference(light_normalisation,[status(thm)],[c_203,c_54]) ).
tcf(c_387,plain,
! [X0: $i] : implies(X0,implies(X0,X0)) = truth,
inference(superposition,[status(thm)],[c_112,c_220]) ).
tcf(c_402,plain,
! [X0: $i] : implies(implies(truth,X0),X0) = truth,
inference(superposition,[status(thm)],[c_220,c_54]) ).
tcf(c_411,plain,
! [X0: $i] : implies(X0,X0) = truth,
inference(light_normalisation,[status(thm)],[c_402,c_54]) ).
tcf(c_537,plain,
! [X0: $i] : implies(X0,truth) = truth,
inference(light_normalisation,[status(thm)],[c_387,c_411]) ).
tcf(c_543,plain,
! [X0: $i,X1: $i] : implies(truth,implies(implies(truth,X0),implies(X1,X0))) = truth,
inference(superposition,[status(thm)],[c_537,c_55]) ).
tcf(c_554,plain,
! [X0: $i,X1: $i] : implies(truth,implies(X0,implies(X1,X0))) = truth,
inference(light_normalisation,[status(thm)],[c_543,c_54]) ).
tcf(c_629,plain,
! [X0: $i,X1: $i] : implies(X0,implies(X1,X0)) = truth,
inference(demodulation,[status(thm)],[c_554,c_54]) ).
tcf(c_644,plain,
! [X0: $i,X1: $i,X2: $i] : implies(truth,implies(implies(implies(X0,X1),X2),implies(X1,X2))) = truth,
inference(superposition,[status(thm)],[c_629,c_55]) ).
tcf(c_847,plain,
! [X0: $i,X1: $i,X2: $i] : implies(implies(implies(X0,X1),X2),implies(X1,X2)) = truth,
inference(demodulation,[status(thm)],[c_644,c_54]) ).
tcf(c_851,plain,
! [X0: $i,X1: $i] : implies(truth,implies(not(X0),implies(X0,X1))) = truth,
inference(superposition,[status(thm)],[c_57,c_847]) ).
tcf(c_936,plain,
! [X0: $i,X1: $i] : implies(not(X0),implies(X0,X1)) = truth,
inference(demodulation,[status(thm)],[c_851,c_54]) ).
tcf(c_937,plain,
! [X0: $i] : implies(not(truth),X0) = truth,
inference(superposition,[status(thm)],[c_54,c_936]) ).
tcf(c_1007,plain,
! [X0: $i] : implies(implies(X0,not(truth)),not(truth)) = implies(truth,X0),
inference(superposition,[status(thm)],[c_937,c_56]) ).
tcf(c_1011,plain,
! [X0: $i] : implies(implies(X0,not(truth)),not(truth)) = X0,
inference(light_normalisation,[status(thm)],[c_1007,c_54]) ).
tcf(c_1041,plain,
! [X0: $i] : implies(not(implies(X0,not(truth))),X0) = truth,
inference(superposition,[status(thm)],[c_1011,c_936]) ).
tcf(c_1142,plain,
! [X0: $i] : implies(truth,implies(X0,implies(not(X0),not(truth)))) = truth,
inference(superposition,[status(thm)],[c_1041,c_57]) ).
tcf(c_1273,plain,
! [X0: $i] : implies(X0,implies(not(X0),not(truth))) = truth,
inference(demodulation,[status(thm)],[c_1142,c_54]) ).
tcf(c_1295,plain,
! [X0: $i] : implies(implies(implies(not(X0),not(truth)),X0),X0) = implies(truth,implies(not(X0),not(truth))),
inference(superposition,[status(thm)],[c_1273,c_56]) ).
tcf(c_1301,plain,
! [X0: $i] : implies(truth,implies(not(X0),not(truth))) = X0,
inference(light_normalisation,[status(thm)],[c_1295,c_54,c_127]) ).
tcf(c_1321,plain,
! [X0: $i] : implies(not(X0),not(truth)) = X0,
inference(demodulation,[status(thm)],[c_1301,c_54]) ).
tcf(c_1326,plain,
! [X0: $i] : implies(not(not(X0)),X0) = truth,
inference(superposition,[status(thm)],[c_1321,c_936]) ).
tcf(c_1348,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_58,c_1326]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL110-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n008.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Wed Sep 23 21:58:39 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.40 Running UEQ theorem proving
% 0.10/0.40 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s ueq_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 1.35/1.18 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 1.35/1.18 % SZS status Started for theBenchmark.p
% 1.35/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 1.35/1.18
% 1.35/1.18 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.35/1.18
% 1.35/1.18 % ------ iProver source info
% 1.35/1.18
% 1.35/1.18 % git: date: 2026-07-19 20:42:38 +0200
% 1.35/1.18 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.35/1.18 % git: non_committed_changes: false
% 1.35/1.18
% 1.35/1.18 % ------ Parsing...% successful
% 1.35/1.18
% 1.35/1.18
% 1.35/1.18 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.35/1.18
% 1.35/1.18 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.35/1.18
% 1.35/1.18 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.35/1.18
% 1.35/1.18 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.35/1.18 % ------ Proving...
% 1.35/1.18 % ------ Problem Properties
% 1.35/1.18
% 1.35/1.18 %
% 1.35/1.18 % clauses 5
% 1.35/1.18 % conjectures 1
% 1.35/1.18 % EPR 0
% 1.35/1.18 % Horn 5
% 1.35/1.18 % unary 5
% 1.35/1.18 % binary 0
% 1.35/1.18 % lits 5
% 1.35/1.18 % lits eq 5
% 1.35/1.18 % fd_pure 0
% 1.35/1.18 % fd_pseudo 0
% 1.35/1.18 % fd_cond 0
% 1.35/1.18 % fd_pseudo_cond 0
% 1.35/1.18 % AC symbols 0
% 1.35/1.18
% 1.35/1.18 % ------ Input Options Time Limit: Unbounded
% 1.35/1.18
% 1.35/1.18
% 1.35/1.18 % ------
% 1.35/1.18 % Current options:
% 1.35/1.18 % ------
% 1.35/1.18
% 1.35/1.18
% 1.35/1.18 %
% 1.35/1.18
% 1.35/1.18 % ------ Proving...
% 1.35/1.18 %
% 1.35/1.18
% 1.35/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 1.35/1.18
% 1.35/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.35/1.18
% 1.35/1.18
%------------------------------------------------------------------------------