TSTP Solution File: LCL133-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL133-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri May 3 02:36:57 EDT 2024
% Result : Unsatisfiable 2.89s 1.11s
% Output : CNFRefutation 2.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of clauses : 20 ( 20 unt; 0 nHn; 4 RR)
% Number of literals : 20 ( 19 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 29 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
implies(X0,X1) = implies(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_antecedent) ).
cnf(c_50,negated_conjecture,
x != y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_wajsberg_lemma) ).
cnf(c_51,plain,
implies(truth,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_1) ).
cnf(c_52,plain,
implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))) = truth,
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_2) ).
cnf(c_53,plain,
implies(implies(X0,X1),X1) = implies(implies(X1,X0),X0),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_3) ).
cnf(c_54,plain,
implies(implies(not(X0),not(X1)),implies(X1,X0)) = truth,
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_4) ).
cnf(c_72,plain,
implies(implies(X0,X1),implies(not(X1),not(X0))) = truth,
inference(demodulation,[status(thm)],[c_54,c_49]) ).
cnf(c_73,plain,
implies(X0,implies(X1,X0)) = implies(X1,implies(X0,X1)),
inference(demodulation,[status(thm)],[c_53,c_49]) ).
cnf(c_79,negated_conjecture,
x != y,
inference(demodulation,[status(thm)],[c_50]) ).
cnf(c_80,negated_conjecture,
implies(X0,X1) = implies(X1,X0),
inference(demodulation,[status(thm)],[c_49]) ).
cnf(c_123,plain,
implies(X0,implies(X0,X1)) = implies(X1,implies(X0,X1)),
inference(superposition,[status(thm)],[c_80,c_73]) ).
cnf(c_157,plain,
implies(implies(not(X0),not(X1)),truth) = implies(implies(X1,X0),truth),
inference(superposition,[status(thm)],[c_72,c_123]) ).
cnf(c_196,plain,
implies(not(X0),not(X1)) = implies(X1,X0),
inference(demodulation,[status(thm)],[c_157,c_80,c_51]) ).
cnf(c_198,plain,
implies(implies(X0,X1),implies(X0,X1)) = truth,
inference(demodulation,[status(thm)],[c_72,c_196]) ).
cnf(c_230,plain,
implies(X0,X0) = X0,
inference(superposition,[status(thm)],[c_51,c_123]) ).
cnf(c_235,plain,
implies(X0,truth) = X0,
inference(superposition,[status(thm)],[c_51,c_80]) ).
cnf(c_396,plain,
implies(X0,implies(implies(X0,X1),implies(X0,X1))) = truth,
inference(superposition,[status(thm)],[c_230,c_52]) ).
cnf(c_404,plain,
X0 = truth,
inference(light_normalisation,[status(thm)],[c_396,c_198,c_235]) ).
cnf(c_409,plain,
y != truth,
inference(demodulation,[status(thm)],[c_79,c_404]) ).
cnf(c_412,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_409,c_404]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : LCL133-1 : TPTP v8.1.2. Released v1.0.0.
% 0.02/0.11 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n009.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 19:08:10 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.42 Running UEQ theorem proving
% 0.17/0.43 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule casc_24_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.89/1.11 % SZS status Started for theBenchmark.p
% 2.89/1.11 % SZS status Unsatisfiable for theBenchmark.p
% 2.89/1.11
% 2.89/1.11 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.89/1.11
% 2.89/1.11 ------ iProver source info
% 2.89/1.11
% 2.89/1.11 git: date: 2024-05-02 19:28:25 +0000
% 2.89/1.11 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.89/1.11 git: non_committed_changes: false
% 2.89/1.11
% 2.89/1.11 ------ Parsing...successful
% 2.89/1.11
% 2.89/1.11
% 2.89/1.11
% 2.89/1.11 ------ Preprocessing... sup_sim: 2 sf_s rm: 0 0s sf_e pe_s pe_e
% 2.89/1.11
% 2.89/1.11 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.89/1.11
% 2.89/1.11 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.89/1.11 ------ Proving...
% 2.89/1.11 ------ Problem Properties
% 2.89/1.11
% 2.89/1.11
% 2.89/1.11 clauses 6
% 2.89/1.11 conjectures 2
% 2.89/1.11 EPR 1
% 2.89/1.11 Horn 6
% 2.89/1.11 unary 6
% 2.89/1.11 binary 0
% 2.89/1.11 lits 6
% 2.89/1.11 lits eq 6
% 2.89/1.11 fd_pure 0
% 2.89/1.11 fd_pseudo 0
% 2.89/1.11 fd_cond 0
% 2.89/1.11 fd_pseudo_cond 0
% 2.89/1.11 AC symbols 0
% 2.89/1.11
% 2.89/1.11 ------ Input Options Time Limit: Unbounded
% 2.89/1.11
% 2.89/1.11
% 2.89/1.11 ------
% 2.89/1.11 Current options:
% 2.89/1.11 ------
% 2.89/1.11
% 2.89/1.11
% 2.89/1.11
% 2.89/1.11
% 2.89/1.11 ------ Proving...
% 2.89/1.11
% 2.89/1.11
% 2.89/1.11 % SZS status Unsatisfiable for theBenchmark.p
% 2.89/1.11
% 2.89/1.11 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.89/1.11
% 2.89/1.11
%------------------------------------------------------------------------------