TSTP Solution File: LCL323-3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL323-3 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n028.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:54 EDT 2023
% Result : Unsatisfiable 9.55s 2.16s
% Output : CNFRefutation 9.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of clauses : 34 ( 20 unt; 0 nHn; 13 RR)
% Number of literals : 50 ( 5 equ; 18 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 81 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(or(implies(p,q),implies(q,r))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_51,plain,
axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
cnf(c_52,plain,
axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
cnf(c_53,plain,
axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
cnf(c_54,plain,
axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
cnf(c_55,plain,
or(not(X0),X1) = implies(X0,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
cnf(c_56,plain,
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_1) ).
cnf(c_57,plain,
( ~ theorem(implies(X0,X1))
| ~ theorem(X0)
| theorem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_2) ).
cnf(c_105,plain,
( implies(X0,or(X1,X0)) != X2
| theorem(X2) ),
inference(resolution_lifted,[status(thm)],[c_51,c_56]) ).
cnf(c_106,plain,
theorem(implies(X0,or(X1,X0))),
inference(unflattening,[status(thm)],[c_105]) ).
cnf(c_111,plain,
( implies(or(X0,X1),or(X1,X0)) != X2
| theorem(X2) ),
inference(resolution_lifted,[status(thm)],[c_52,c_56]) ).
cnf(c_112,plain,
theorem(implies(or(X0,X1),or(X1,X0))),
inference(unflattening,[status(thm)],[c_111]) ).
cnf(c_117,plain,
( implies(or(X0,or(X1,X2)),or(X1,or(X0,X2))) != X3
| theorem(X3) ),
inference(resolution_lifted,[status(thm)],[c_53,c_56]) ).
cnf(c_118,plain,
theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(unflattening,[status(thm)],[c_117]) ).
cnf(c_123,plain,
( implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1))) != X3
| theorem(X3) ),
inference(resolution_lifted,[status(thm)],[c_54,c_56]) ).
cnf(c_124,plain,
theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
inference(unflattening,[status(thm)],[c_123]) ).
cnf(c_680,plain,
theorem(implies(X0,implies(X1,X0))),
inference(superposition,[status(thm)],[c_55,c_106]) ).
cnf(c_686,plain,
theorem(implies(or(not(X0),or(X1,X2)),or(X1,implies(X0,X2)))),
inference(superposition,[status(thm)],[c_55,c_118]) ).
cnf(c_687,plain,
theorem(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2)))),
inference(demodulation,[status(thm)],[c_686,c_55]) ).
cnf(c_692,plain,
theorem(implies(implies(X0,X1),implies(or(not(X2),X0),implies(X2,X1)))),
inference(superposition,[status(thm)],[c_55,c_124]) ).
cnf(c_693,plain,
theorem(implies(implies(X0,X1),implies(implies(X2,X0),implies(X2,X1)))),
inference(demodulation,[status(thm)],[c_692,c_55]) ).
cnf(c_706,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X1,X0)) ),
inference(superposition,[status(thm)],[c_112,c_57]) ).
cnf(c_711,plain,
( ~ theorem(X0)
| theorem(implies(X1,X0)) ),
inference(superposition,[status(thm)],[c_680,c_57]) ).
cnf(c_714,plain,
( ~ theorem(implies(X0,or(X1,X2)))
| theorem(or(X1,implies(X0,X2))) ),
inference(superposition,[status(thm)],[c_687,c_57]) ).
cnf(c_716,plain,
( ~ theorem(implies(X0,X1))
| theorem(implies(implies(X2,X0),implies(X2,X1))) ),
inference(superposition,[status(thm)],[c_693,c_57]) ).
cnf(c_794,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X0,implies(X2,X1))) ),
inference(superposition,[status(thm)],[c_711,c_714]) ).
cnf(c_805,plain,
( ~ theorem(implies(X0,X1))
| ~ theorem(implies(X2,X0))
| theorem(implies(X2,X1)) ),
inference(superposition,[status(thm)],[c_716,c_57]) ).
cnf(c_939,plain,
( ~ theorem(or(X0,X1))
| theorem(or(implies(X2,X1),X0)) ),
inference(superposition,[status(thm)],[c_794,c_706]) ).
cnf(c_960,plain,
( ~ theorem(implies(X0,or(X1,X2)))
| theorem(implies(X0,or(X2,X1))) ),
inference(superposition,[status(thm)],[c_112,c_805]) ).
cnf(c_2108,plain,
~ theorem(or(implies(q,r),q)),
inference(superposition,[status(thm)],[c_939,c_49]) ).
cnf(c_2505,plain,
theorem(implies(X0,or(X0,X1))),
inference(superposition,[status(thm)],[c_106,c_960]) ).
cnf(c_3082,plain,
theorem(or(X0,implies(X0,X1))),
inference(superposition,[status(thm)],[c_2505,c_714]) ).
cnf(c_3098,plain,
theorem(or(implies(X0,X1),X0)),
inference(superposition,[status(thm)],[c_3082,c_706]) ).
cnf(c_3153,plain,
$false,
inference(superposition,[status(thm)],[c_3098,c_2108]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL323-3 : TPTP v8.1.2. Released v2.3.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 24 18:55:20 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 9.55/2.16 % SZS status Started for theBenchmark.p
% 9.55/2.16 % SZS status Unsatisfiable for theBenchmark.p
% 9.55/2.16
% 9.55/2.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 9.55/2.16
% 9.55/2.16 ------ iProver source info
% 9.55/2.16
% 9.55/2.16 git: date: 2023-05-31 18:12:56 +0000
% 9.55/2.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 9.55/2.16 git: non_committed_changes: false
% 9.55/2.16 git: last_make_outside_of_git: false
% 9.55/2.16
% 9.55/2.16 ------ Parsing...successful
% 9.55/2.16
% 9.55/2.16
% 9.55/2.16
% 9.55/2.16 ------ Preprocessing... sup_sim: 0 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
% 9.55/2.16
% 9.55/2.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 9.55/2.16
% 9.55/2.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 9.55/2.16 ------ Proving...
% 9.55/2.16 ------ Problem Properties
% 9.55/2.16
% 9.55/2.16
% 9.55/2.16 clauses 8
% 9.55/2.16 conjectures 1
% 9.55/2.16 EPR 0
% 9.55/2.16 Horn 8
% 9.55/2.16 unary 7
% 9.55/2.16 binary 0
% 9.55/2.16 lits 10
% 9.55/2.16 lits eq 1
% 9.55/2.16 fd_pure 0
% 9.55/2.16 fd_pseudo 0
% 9.55/2.16 fd_cond 0
% 9.55/2.16 fd_pseudo_cond 0
% 9.55/2.16 AC symbols 0
% 9.55/2.16
% 9.55/2.16 ------ Input Options Time Limit: Unbounded
% 9.55/2.16
% 9.55/2.16
% 9.55/2.16 ------
% 9.55/2.16 Current options:
% 9.55/2.16 ------
% 9.55/2.16
% 9.55/2.16
% 9.55/2.16
% 9.55/2.16
% 9.55/2.16 ------ Proving...
% 9.55/2.16
% 9.55/2.16
% 9.55/2.16 % SZS status Unsatisfiable for theBenchmark.p
% 9.55/2.16
% 9.55/2.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 9.55/2.17
% 9.55/2.17
%------------------------------------------------------------------------------