TSTP Solution File: LCL111-2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL111-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n024.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 : Thu Aug 31 07:42:33 EDT 2023
% Result : Unsatisfiable 7.50s 1.65s
% Output : CNFRefutation 7.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 33
% Number of leaves : 5
% Syntax : Number of clauses : 43 ( 43 unt; 0 nHn; 3 RR)
% Number of literals : 43 ( 42 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 67 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
implies(implies(x,y),implies(implies(z,x),implies(z,y))) != truth,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_mv_25) ).
cnf(c_50,plain,
implies(truth,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_1) ).
cnf(c_51,plain,
implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))) = truth,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_2) ).
cnf(c_52,plain,
implies(implies(X0,X1),X1) = implies(implies(X1,X0),X0),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_3) ).
cnf(c_53,plain,
implies(implies(not(X0),not(X1)),implies(X1,X0)) = truth,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_4) ).
cnf(c_100,plain,
implies(implies(X0,truth),truth) = implies(X0,X0),
inference(superposition,[status(thm)],[c_50,c_52]) ).
cnf(c_103,plain,
implies(implies(not(X0),not(truth)),X0) = truth,
inference(superposition,[status(thm)],[c_50,c_53]) ).
cnf(c_123,plain,
implies(implies(truth,X0),implies(implies(X0,X1),X1)) = truth,
inference(superposition,[status(thm)],[c_50,c_51]) ).
cnf(c_135,plain,
implies(X0,implies(implies(X0,X1),X1)) = truth,
inference(light_normalisation,[status(thm)],[c_123,c_50]) ).
cnf(c_226,plain,
implies(implies(truth,X0),X0) = truth,
inference(superposition,[status(thm)],[c_135,c_50]) ).
cnf(c_235,plain,
implies(X0,X0) = truth,
inference(light_normalisation,[status(thm)],[c_226,c_50]) ).
cnf(c_237,plain,
implies(implies(X0,truth),truth) = truth,
inference(demodulation,[status(thm)],[c_100,c_235]) ).
cnf(c_274,plain,
implies(X0,truth) = truth,
inference(superposition,[status(thm)],[c_237,c_135]) ).
cnf(c_310,plain,
implies(truth,implies(implies(truth,X0),implies(X1,X0))) = truth,
inference(superposition,[status(thm)],[c_274,c_51]) ).
cnf(c_327,plain,
implies(truth,implies(X0,implies(X1,X0))) = truth,
inference(light_normalisation,[status(thm)],[c_310,c_50]) ).
cnf(c_363,plain,
implies(X0,implies(X1,X0)) = truth,
inference(superposition,[status(thm)],[c_327,c_50]) ).
cnf(c_395,plain,
implies(truth,implies(implies(implies(X0,X1),X2),implies(X1,X2))) = truth,
inference(superposition,[status(thm)],[c_363,c_51]) ).
cnf(c_554,plain,
implies(truth,implies(truth,implies(not(truth),X0))) = truth,
inference(superposition,[status(thm)],[c_103,c_395]) ).
cnf(c_593,plain,
implies(implies(implies(X0,X1),X2),implies(X1,X2)) = truth,
inference(superposition,[status(thm)],[c_395,c_50]) ).
cnf(c_648,plain,
implies(not(truth),X0) = truth,
inference(superposition,[status(thm)],[c_50,c_554]) ).
cnf(c_686,plain,
implies(implies(X0,not(truth)),not(truth)) = implies(truth,X0),
inference(superposition,[status(thm)],[c_648,c_52]) ).
cnf(c_689,plain,
implies(implies(X0,not(truth)),not(truth)) = X0,
inference(light_normalisation,[status(thm)],[c_686,c_50]) ).
cnf(c_738,plain,
implies(truth,implies(not(X0),implies(X0,X1))) = truth,
inference(superposition,[status(thm)],[c_53,c_593]) ).
cnf(c_832,plain,
implies(not(X0),implies(X0,X1)) = truth,
inference(superposition,[status(thm)],[c_738,c_50]) ).
cnf(c_878,plain,
implies(not(implies(X0,not(truth))),X0) = truth,
inference(superposition,[status(thm)],[c_689,c_832]) ).
cnf(c_943,plain,
implies(truth,implies(X0,implies(not(X0),not(truth)))) = truth,
inference(superposition,[status(thm)],[c_878,c_53]) ).
cnf(c_964,plain,
implies(X0,implies(not(X0),not(truth))) = truth,
inference(superposition,[status(thm)],[c_943,c_50]) ).
cnf(c_1006,plain,
implies(implies(implies(not(X0),not(truth)),X0),X0) = implies(truth,implies(not(X0),not(truth))),
inference(superposition,[status(thm)],[c_964,c_52]) ).
cnf(c_1009,plain,
implies(truth,implies(not(X0),not(truth))) = X0,
inference(light_normalisation,[status(thm)],[c_1006,c_50,c_103]) ).
cnf(c_1022,plain,
implies(not(X0),not(truth)) = X0,
inference(superposition,[status(thm)],[c_1009,c_50]) ).
cnf(c_1066,plain,
implies(X0,not(truth)) = not(X0),
inference(superposition,[status(thm)],[c_1022,c_689]) ).
cnf(c_1071,plain,
not(not(X0)) = X0,
inference(demodulation,[status(thm)],[c_1022,c_1066]) ).
cnf(c_1087,plain,
implies(implies(X0,not(X1)),implies(X1,not(X0))) = truth,
inference(superposition,[status(thm)],[c_1071,c_53]) ).
cnf(c_1198,plain,
implies(implies(implies(X0,not(X1)),implies(X1,not(X0))),implies(X1,not(X0))) = implies(truth,implies(X0,not(X1))),
inference(superposition,[status(thm)],[c_1087,c_52]) ).
cnf(c_1203,plain,
implies(truth,implies(X0,not(X1))) = implies(truth,implies(X1,not(X0))),
inference(light_normalisation,[status(thm)],[c_1198,c_1087]) ).
cnf(c_2843,plain,
implies(truth,implies(X0,not(X1))) = implies(X1,not(X0)),
inference(superposition,[status(thm)],[c_1203,c_50]) ).
cnf(c_2936,plain,
implies(X0,not(X1)) = implies(X1,not(X0)),
inference(superposition,[status(thm)],[c_2843,c_50]) ).
cnf(c_3028,plain,
implies(not(X0),not(X1)) = implies(X1,X0),
inference(superposition,[status(thm)],[c_1071,c_2936]) ).
cnf(c_3190,plain,
implies(implies(X0,not(X1)),implies(implies(X2,X1),implies(X0,not(X2)))) = truth,
inference(superposition,[status(thm)],[c_3028,c_51]) ).
cnf(c_13110,plain,
implies(implies(not(X0),not(X1)),implies(implies(X2,X1),implies(X2,X0))) = truth,
inference(superposition,[status(thm)],[c_3028,c_3190]) ).
cnf(c_13218,plain,
implies(implies(X0,X1),implies(implies(X2,X0),implies(X2,X1))) = truth,
inference(light_normalisation,[status(thm)],[c_13110,c_3028]) ).
cnf(c_13269,plain,
truth != truth,
inference(demodulation,[status(thm)],[c_49,c_13218]) ).
cnf(c_13270,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_13269]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL111-2 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri Aug 25 05:37:39 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.20/0.46 Running UEQ theorem proving
% 0.20/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule casc_29_ueq --heuristic_context ueq --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 7.50/1.65 % SZS status Started for theBenchmark.p
% 7.50/1.65 % SZS status Unsatisfiable for theBenchmark.p
% 7.50/1.65
% 7.50/1.65 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 7.50/1.65
% 7.50/1.65 ------ iProver source info
% 7.50/1.65
% 7.50/1.65 git: date: 2023-05-31 18:12:56 +0000
% 7.50/1.65 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 7.50/1.65 git: non_committed_changes: false
% 7.50/1.65 git: last_make_outside_of_git: false
% 7.50/1.65
% 7.50/1.65 ------ Parsing...successful
% 7.50/1.65
% 7.50/1.65
% 7.50/1.65
% 7.50/1.65 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 7.50/1.65
% 7.50/1.65 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.50/1.65
% 7.50/1.65 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 7.50/1.65 ------ Proving...
% 7.50/1.65 ------ Problem Properties
% 7.50/1.65
% 7.50/1.65
% 7.50/1.65 clauses 5
% 7.50/1.65 conjectures 1
% 7.50/1.65 EPR 0
% 7.50/1.65 Horn 5
% 7.50/1.65 unary 5
% 7.50/1.65 binary 0
% 7.50/1.65 lits 5
% 7.50/1.65 lits eq 5
% 7.50/1.65 fd_pure 0
% 7.50/1.65 fd_pseudo 0
% 7.50/1.65 fd_cond 0
% 7.50/1.65 fd_pseudo_cond 0
% 7.50/1.65 AC symbols 0
% 7.50/1.65
% 7.50/1.65 ------ Input Options Time Limit: Unbounded
% 7.50/1.65
% 7.50/1.65
% 7.50/1.65 ------
% 7.50/1.65 Current options:
% 7.50/1.65 ------
% 7.50/1.65
% 7.50/1.65
% 7.50/1.65
% 7.50/1.65
% 7.50/1.65 ------ Proving...
% 7.50/1.65
% 7.50/1.65
% 7.50/1.65 % SZS status Unsatisfiable for theBenchmark.p
% 7.50/1.65
% 7.50/1.65 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.50/1.65
% 7.50/1.65
%------------------------------------------------------------------------------