TSTP Solution File: LCL112-2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL112-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n005.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:53 EDT 2024
% Result : Unsatisfiable 3.43s 1.15s
% Output : CNFRefutation 3.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 5
% Syntax : Number of clauses : 34 ( 34 unt; 0 nHn; 3 RR)
% Number of literals : 34 ( 33 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 46 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
implies(x,not(not(x))) != truth,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_mv_29) ).
cnf(c_50,plain,
implies(truth,X0) = X0,
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_2) ).
cnf(c_52,plain,
implies(implies(X0,X1),X1) = implies(implies(X1,X0),X0),
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_3) ).
cnf(c_53,plain,
implies(implies(not(X0),not(X1)),implies(X1,X0)) = truth,
file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_4) ).
cnf(c_107,plain,
implies(implies(X0,truth),truth) = implies(X0,X0),
inference(superposition,[status(thm)],[c_50,c_52]) ).
cnf(c_110,plain,
implies(implies(not(X0),not(truth)),X0) = truth,
inference(superposition,[status(thm)],[c_50,c_53]) ).
cnf(c_130,plain,
implies(implies(truth,X0),implies(implies(X0,X1),X1)) = truth,
inference(superposition,[status(thm)],[c_50,c_51]) ).
cnf(c_142,plain,
implies(X0,implies(implies(X0,X1),X1)) = truth,
inference(light_normalisation,[status(thm)],[c_130,c_50]) ).
cnf(c_233,plain,
implies(implies(truth,X0),X0) = truth,
inference(superposition,[status(thm)],[c_142,c_50]) ).
cnf(c_242,plain,
implies(X0,X0) = truth,
inference(light_normalisation,[status(thm)],[c_233,c_50]) ).
cnf(c_244,plain,
implies(implies(X0,truth),truth) = truth,
inference(demodulation,[status(thm)],[c_107,c_242]) ).
cnf(c_281,plain,
implies(X0,truth) = truth,
inference(superposition,[status(thm)],[c_244,c_142]) ).
cnf(c_317,plain,
implies(truth,implies(implies(truth,X0),implies(X1,X0))) = truth,
inference(superposition,[status(thm)],[c_281,c_51]) ).
cnf(c_334,plain,
implies(truth,implies(X0,implies(X1,X0))) = truth,
inference(light_normalisation,[status(thm)],[c_317,c_50]) ).
cnf(c_370,plain,
implies(X0,implies(X1,X0)) = truth,
inference(superposition,[status(thm)],[c_334,c_50]) ).
cnf(c_402,plain,
implies(truth,implies(implies(implies(X0,X1),X2),implies(X1,X2))) = truth,
inference(superposition,[status(thm)],[c_370,c_51]) ).
cnf(c_561,plain,
implies(truth,implies(truth,implies(not(truth),X0))) = truth,
inference(superposition,[status(thm)],[c_110,c_402]) ).
cnf(c_600,plain,
implies(implies(implies(X0,X1),X2),implies(X1,X2)) = truth,
inference(superposition,[status(thm)],[c_402,c_50]) ).
cnf(c_655,plain,
implies(not(truth),X0) = truth,
inference(superposition,[status(thm)],[c_50,c_561]) ).
cnf(c_693,plain,
implies(implies(X0,not(truth)),not(truth)) = implies(truth,X0),
inference(superposition,[status(thm)],[c_655,c_52]) ).
cnf(c_696,plain,
implies(implies(X0,not(truth)),not(truth)) = X0,
inference(light_normalisation,[status(thm)],[c_693,c_50]) ).
cnf(c_745,plain,
implies(truth,implies(not(X0),implies(X0,X1))) = truth,
inference(superposition,[status(thm)],[c_53,c_600]) ).
cnf(c_839,plain,
implies(not(X0),implies(X0,X1)) = truth,
inference(superposition,[status(thm)],[c_745,c_50]) ).
cnf(c_885,plain,
implies(not(implies(X0,not(truth))),X0) = truth,
inference(superposition,[status(thm)],[c_696,c_839]) ).
cnf(c_950,plain,
implies(truth,implies(X0,implies(not(X0),not(truth)))) = truth,
inference(superposition,[status(thm)],[c_885,c_53]) ).
cnf(c_971,plain,
implies(X0,implies(not(X0),not(truth))) = truth,
inference(superposition,[status(thm)],[c_950,c_50]) ).
cnf(c_1013,plain,
implies(implies(implies(not(X0),not(truth)),X0),X0) = implies(truth,implies(not(X0),not(truth))),
inference(superposition,[status(thm)],[c_971,c_52]) ).
cnf(c_1016,plain,
implies(truth,implies(not(X0),not(truth))) = X0,
inference(light_normalisation,[status(thm)],[c_1013,c_50,c_110]) ).
cnf(c_1029,plain,
implies(not(X0),not(truth)) = X0,
inference(superposition,[status(thm)],[c_1016,c_50]) ).
cnf(c_1073,plain,
implies(X0,not(truth)) = not(X0),
inference(superposition,[status(thm)],[c_1029,c_696]) ).
cnf(c_1078,plain,
not(not(X0)) = X0,
inference(demodulation,[status(thm)],[c_1029,c_1073]) ).
cnf(c_1079,plain,
implies(x,x) != truth,
inference(demodulation,[status(thm)],[c_49,c_1078]) ).
cnf(c_1081,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1079,c_242]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : LCL112-2 : TPTP v8.1.2. Released v1.0.0.
% 0.13/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n005.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu May 2 18:58:56 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.48 Running UEQ theorem proving
% 0.21/0.48 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
% 3.43/1.15 % SZS status Started for theBenchmark.p
% 3.43/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 3.43/1.15
% 3.43/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.43/1.15
% 3.43/1.15 ------ iProver source info
% 3.43/1.15
% 3.43/1.15 git: date: 2024-05-02 19:28:25 +0000
% 3.43/1.15 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.43/1.15 git: non_committed_changes: false
% 3.43/1.15
% 3.43/1.15 ------ Parsing...successful
% 3.43/1.15
% 3.43/1.15
% 3.43/1.15
% 3.43/1.15 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.43/1.15
% 3.43/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.43/1.15
% 3.43/1.15 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.43/1.15 ------ Proving...
% 3.43/1.15 ------ Problem Properties
% 3.43/1.15
% 3.43/1.15
% 3.43/1.15 clauses 5
% 3.43/1.15 conjectures 1
% 3.43/1.15 EPR 0
% 3.43/1.15 Horn 5
% 3.43/1.15 unary 5
% 3.43/1.15 binary 0
% 3.43/1.15 lits 5
% 3.43/1.15 lits eq 5
% 3.43/1.15 fd_pure 0
% 3.43/1.15 fd_pseudo 0
% 3.43/1.15 fd_cond 0
% 3.43/1.15 fd_pseudo_cond 0
% 3.43/1.15 AC symbols 0
% 3.43/1.15
% 3.43/1.15 ------ Input Options Time Limit: Unbounded
% 3.43/1.15
% 3.43/1.15
% 3.43/1.15 ------
% 3.43/1.15 Current options:
% 3.43/1.15 ------
% 3.43/1.15
% 3.43/1.15
% 3.43/1.15
% 3.43/1.15
% 3.43/1.15 ------ Proving...
% 3.43/1.15
% 3.43/1.15
% 3.43/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 3.43/1.15
% 3.43/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.43/1.15
% 3.43/1.15
%------------------------------------------------------------------------------