TSTP Solution File: LCL234-3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL234-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n027.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:43:24 EDT 2023
% Result : Unsatisfiable 14.01s 2.76s
% Output : CNFRefutation 14.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of clauses : 41 ( 28 unt; 0 nHn; 14 RR)
% Number of literals : 56 ( 8 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 94 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(implies(p,implies(q,and(p,q)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_50,plain,
not(or(not(X0),not(X1))) = and(X0,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-1.ax',and_defn) ).
cnf(c_51,plain,
axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
cnf(c_52,plain,
axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
cnf(c_53,plain,
axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
cnf(c_54,plain,
axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
cnf(c_55,plain,
axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
cnf(c_56,plain,
or(not(X0),X1) = implies(X0,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
cnf(c_57,plain,
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_1) ).
cnf(c_58,plain,
( ~ theorem(implies(X0,X1))
| ~ theorem(X0)
| theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_2) ).
cnf(c_96,plain,
not(implies(X0,not(X1))) = and(X0,X1),
inference(demodulation,[status(thm)],[c_50,c_56]) ).
cnf(c_107,plain,
( implies(or(X0,X0),X0) != X1
| theorem(X1) ),
inference(resolution_lifted,[status(thm)],[c_51,c_57]) ).
cnf(c_108,plain,
theorem(implies(or(X0,X0),X0)),
inference(unflattening,[status(thm)],[c_107]) ).
cnf(c_113,plain,
( implies(X0,or(X1,X0)) != X2
| theorem(X2) ),
inference(resolution_lifted,[status(thm)],[c_52,c_57]) ).
cnf(c_114,plain,
theorem(implies(X0,or(X1,X0))),
inference(unflattening,[status(thm)],[c_113]) ).
cnf(c_119,plain,
( implies(or(X0,X1),or(X1,X0)) != X2
| theorem(X2) ),
inference(resolution_lifted,[status(thm)],[c_53,c_57]) ).
cnf(c_120,plain,
theorem(implies(or(X0,X1),or(X1,X0))),
inference(unflattening,[status(thm)],[c_119]) ).
cnf(c_125,plain,
( implies(or(X0,or(X1,X2)),or(X1,or(X0,X2))) != X3
| theorem(X3) ),
inference(resolution_lifted,[status(thm)],[c_54,c_57]) ).
cnf(c_126,plain,
theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(unflattening,[status(thm)],[c_125]) ).
cnf(c_131,plain,
( implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1))) != X3
| theorem(X3) ),
inference(resolution_lifted,[status(thm)],[c_55,c_57]) ).
cnf(c_132,plain,
theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
inference(unflattening,[status(thm)],[c_131]) ).
cnf(c_750,plain,
theorem(implies(or(X0,not(X1)),implies(X1,X0))),
inference(superposition,[status(thm)],[c_56,c_120]) ).
cnf(c_753,plain,
theorem(implies(implies(X0,not(X1)),implies(X1,not(X0)))),
inference(superposition,[status(thm)],[c_56,c_750]) ).
cnf(c_757,plain,
theorem(implies(or(not(X0),or(X1,X2)),or(X1,implies(X0,X2)))),
inference(superposition,[status(thm)],[c_56,c_126]) ).
cnf(c_758,plain,
theorem(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2)))),
inference(demodulation,[status(thm)],[c_757,c_56]) ).
cnf(c_763,plain,
theorem(implies(implies(X0,X1),implies(or(not(X2),X0),implies(X2,X1)))),
inference(superposition,[status(thm)],[c_56,c_132]) ).
cnf(c_764,plain,
theorem(implies(implies(X0,X1),implies(implies(X2,X0),implies(X2,X1)))),
inference(demodulation,[status(thm)],[c_763,c_56]) ).
cnf(c_768,plain,
theorem(implies(implies(X0,or(not(X1),X2)),implies(X1,implies(X0,X2)))),
inference(superposition,[status(thm)],[c_56,c_758]) ).
cnf(c_769,plain,
theorem(implies(implies(X0,implies(X1,X2)),implies(X1,implies(X0,X2)))),
inference(demodulation,[status(thm)],[c_768,c_56]) ).
cnf(c_775,plain,
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(superposition,[status(thm)],[c_108,c_58]) ).
cnf(c_785,plain,
( ~ theorem(implies(X0,or(X1,X2)))
| theorem(or(X1,implies(X0,X2))) ),
inference(superposition,[status(thm)],[c_758,c_58]) ).
cnf(c_787,plain,
( ~ theorem(implies(X0,X1))
| theorem(implies(implies(X2,X0),implies(X2,X1))) ),
inference(superposition,[status(thm)],[c_764,c_58]) ).
cnf(c_788,plain,
( ~ theorem(implies(X0,implies(X1,X2)))
| theorem(implies(X1,implies(X0,X2))) ),
inference(superposition,[status(thm)],[c_769,c_58]) ).
cnf(c_858,plain,
theorem(or(X0,implies(X1,X1))),
inference(superposition,[status(thm)],[c_114,c_785]) ).
cnf(c_875,plain,
( ~ theorem(implies(X0,X1))
| ~ theorem(implies(X2,X0))
| theorem(implies(X2,X1)) ),
inference(superposition,[status(thm)],[c_787,c_58]) ).
cnf(c_944,plain,
theorem(implies(X0,X0)),
inference(superposition,[status(thm)],[c_858,c_775]) ).
cnf(c_968,plain,
theorem(implies(X0,implies(implies(X0,X1),X1))),
inference(superposition,[status(thm)],[c_944,c_788]) ).
cnf(c_1031,plain,
( ~ theorem(implies(X0,implies(X1,not(X2))))
| theorem(implies(X0,implies(X2,not(X1)))) ),
inference(superposition,[status(thm)],[c_753,c_875]) ).
cnf(c_2674,plain,
theorem(implies(X0,implies(X1,not(implies(X0,not(X1)))))),
inference(superposition,[status(thm)],[c_968,c_1031]) ).
cnf(c_2677,plain,
theorem(implies(X0,implies(X1,and(X0,X1)))),
inference(demodulation,[status(thm)],[c_2674,c_96]) ).
cnf(c_5863,plain,
$false,
inference(superposition,[status(thm)],[c_2677,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : LCL234-3 : TPTP v8.1.2. Released v2.3.0.
% 0.12/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n027.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 Aug 24 18:52:18 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 14.01/2.76 % SZS status Started for theBenchmark.p
% 14.01/2.76 % SZS status Unsatisfiable for theBenchmark.p
% 14.01/2.76
% 14.01/2.76 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 14.01/2.76
% 14.01/2.76 ------ iProver source info
% 14.01/2.76
% 14.01/2.76 git: date: 2023-05-31 18:12:56 +0000
% 14.01/2.76 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 14.01/2.76 git: non_committed_changes: false
% 14.01/2.76 git: last_make_outside_of_git: false
% 14.01/2.76
% 14.01/2.76 ------ Parsing...successful
% 14.01/2.76
% 14.01/2.76
% 14.01/2.76
% 14.01/2.76 ------ Preprocessing... sup_sim: 1 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 14.01/2.76
% 14.01/2.76 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 14.01/2.76
% 14.01/2.76 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 14.01/2.76 ------ Proving...
% 14.01/2.76 ------ Problem Properties
% 14.01/2.76
% 14.01/2.76
% 14.01/2.76 clauses 9
% 14.01/2.76 conjectures 1
% 14.01/2.76 EPR 0
% 14.01/2.76 Horn 9
% 14.01/2.76 unary 8
% 14.01/2.76 binary 0
% 14.01/2.76 lits 11
% 14.01/2.76 lits eq 2
% 14.01/2.76 fd_pure 0
% 14.01/2.76 fd_pseudo 0
% 14.01/2.76 fd_cond 0
% 14.01/2.76 fd_pseudo_cond 0
% 14.01/2.76 AC symbols 0
% 14.01/2.76
% 14.01/2.76 ------ Input Options Time Limit: Unbounded
% 14.01/2.76
% 14.01/2.76
% 14.01/2.76 ------
% 14.01/2.76 Current options:
% 14.01/2.76 ------
% 14.01/2.76
% 14.01/2.76
% 14.01/2.76
% 14.01/2.76
% 14.01/2.76 ------ Proving...
% 14.01/2.76
% 14.01/2.76
% 14.01/2.76 % SZS status Unsatisfiable for theBenchmark.p
% 14.01/2.76
% 14.01/2.76 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 14.01/2.76
% 14.01/2.76
%------------------------------------------------------------------------------