%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL135-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 : n003.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:45 PM UTC 2026
% Result : Unsatisfiable 2.33s 1.30s
% Output : CNFRefutation 2.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 22 unt; 0 def)
% Number of atoms : 22 ( 21 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 4 ( 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; 3 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn 30 !; 0 ?; 21 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : implies(truth,X0) = X0,
file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_3) ).
fof(f7,negated_conjecture,
implies(x,implies(y,x)) != truth,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_wajsberg_lemma) ).
fof(f8,plain,
truth != implies(x,implies(y,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_58,negated_conjecture,
implies(x,implies(y,x)) != truth,
inference(cnf_transformation,[],[f8]) ).
tcf(c_105,plain,
! [X0: $i] : implies(implies(X0,truth),truth) = implies(X0,X0),
inference(superposition,[status(thm)],[c_54,c_56]) ).
tcf(c_196,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_213,plain,
! [X0: $i,X1: $i] : implies(X0,implies(implies(X0,X1),X1)) = truth,
inference(light_normalisation,[status(thm)],[c_196,c_54]) ).
tcf(c_397,plain,
! [X0: $i] : implies(X0,implies(X0,X0)) = truth,
inference(superposition,[status(thm)],[c_105,c_213]) ).
tcf(c_412,plain,
! [X0: $i] : implies(implies(truth,X0),X0) = truth,
inference(superposition,[status(thm)],[c_213,c_54]) ).
tcf(c_421,plain,
! [X0: $i] : implies(X0,X0) = truth,
inference(light_normalisation,[status(thm)],[c_412,c_54]) ).
tcf(c_554,plain,
! [X0: $i] : implies(X0,truth) = truth,
inference(light_normalisation,[status(thm)],[c_397,c_421]) ).
tcf(c_560,plain,
! [X0: $i,X1: $i] : implies(truth,implies(implies(truth,X0),implies(X1,X0))) = truth,
inference(superposition,[status(thm)],[c_554,c_55]) ).
tcf(c_571,plain,
! [X0: $i,X1: $i] : implies(truth,implies(X0,implies(X1,X0))) = truth,
inference(light_normalisation,[status(thm)],[c_560,c_54]) ).
tcf(c_605,plain,
! [X0: $i,X1: $i] : implies(X0,implies(X1,X0)) = truth,
inference(demodulation,[status(thm)],[c_571,c_54]) ).
tcf(c_606,plain,
truth != truth,
inference(demodulation,[status(thm)],[c_58,c_605]) ).
tcf(c_608,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_606]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL135-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.10/0.39 % Computer : n003.cluster.edu
% 0.10/0.39 % Model : x86_64 x86_64
% 0.10/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.39 % Memory : 8046.5625MB
% 0.10/0.39 % OS : Linux 6.8.0-71-generic
% 0.10/0.39 % CPULimit : 300
% 0.10/0.39 % WCLimit : 300
% 0.10/0.39 % DateTime : Wed Sep 23 22:05:06 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.43 Running UEQ theorem proving
% 0.10/0.43 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s ueq_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.44
% 0.10/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.44
% 0.10/0.44 % Detected problem language: tptp
% 0.10/0.45 % Proving...
% 2.33/1.30 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.33/1.30 % SZS status Started for theBenchmark.p
% 2.33/1.30 % SZS status Unsatisfiable for theBenchmark.p
% 2.33/1.30
% 2.33/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.33/1.30
% 2.33/1.30 % ------ iProver source info
% 2.33/1.30
% 2.33/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 2.33/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.33/1.30 % git: non_committed_changes: false
% 2.33/1.30
% 2.33/1.30 % ------ Parsing...% successful
% 2.33/1.30
% 2.33/1.30
% 2.33/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.33/1.30
% 2.33/1.30 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.33/1.30
% 2.33/1.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.33/1.30
% 2.33/1.30 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.33/1.30 % ------ Proving...
% 2.33/1.30 % ------ Problem Properties
% 2.33/1.30
% 2.33/1.30 %
% 2.33/1.30 % clauses 5
% 2.33/1.30 % conjectures 1
% 2.33/1.30 % EPR 0
% 2.33/1.30 % Horn 5
% 2.33/1.30 % unary 5
% 2.33/1.30 % binary 0
% 2.33/1.30 % lits 5
% 2.33/1.30 % lits eq 5
% 2.33/1.30 % fd_pure 0
% 2.33/1.30 % fd_pseudo 0
% 2.33/1.30 % fd_cond 0
% 2.33/1.30 % fd_pseudo_cond 0
% 2.33/1.30 % AC symbols 0
% 2.33/1.30
% 2.33/1.30 % ------ Input Options Time Limit: Unbounded
% 2.33/1.30
% 2.33/1.30
% 2.33/1.30 % ------
% 2.33/1.30 % Current options:
% 2.33/1.30 % ------
% 2.33/1.30
% 2.33/1.30
% 2.33/1.30 %
% 2.33/1.30
% 2.33/1.30 % ------ Proving...
% 2.33/1.30 %
% 2.33/1.30
% 2.33/1.30 % SZS status Unsatisfiable for theBenchmark.p
% 2.33/1.30
% 2.33/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.33/1.30
% 2.33/1.30
%------------------------------------------------------------------------------