TSTP Solution File: LCL192-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL192-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n016.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:37:10 EDT 2024
% Result : Unsatisfiable 0.48s 1.15s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 24 ( 10 unt; 0 nHn; 20 RR)
% Number of literals : 49 ( 0 equ; 26 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(or(not(or(or(p,q),r)),or(p,or(q,r)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_52,plain,
axiom(or(not(or(X0,X1)),or(X1,X0))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_4) ).
cnf(c_53,plain,
axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_5) ).
cnf(c_54,plain,
axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_6) ).
cnf(c_55,plain,
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_1) ).
cnf(c_56,plain,
( ~ axiom(or(not(X0),X1))
| ~ theorem(X0)
| theorem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_2) ).
cnf(c_57,plain,
( ~ theorem(or(not(X0),X1))
| ~ axiom(or(not(X2),X0))
| theorem(or(not(X2),X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_3) ).
cnf(c_243,plain,
( ~ axiom(or(not(or(X0,X1)),or(X1,X0)))
| theorem(or(not(or(X0,X1)),or(X1,X0))) ),
inference(instantiation,[status(thm)],[c_55]) ).
cnf(c_250,plain,
( ~ theorem(or(not(X0),or(p,or(q,r))))
| ~ axiom(or(not(or(or(p,q),r)),X0))
| theorem(or(not(or(or(p,q),r)),or(p,or(q,r)))) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_252,plain,
( ~ axiom(or(not(or(not(X0),X1)),X2))
| ~ theorem(or(not(X0),X1))
| theorem(X2) ),
inference(instantiation,[status(thm)],[c_56]) ).
cnf(c_264,plain,
( ~ theorem(or(not(X0),or(p,or(q,r))))
| ~ axiom(or(not(X1),X0))
| theorem(or(not(X1),or(p,or(q,r)))) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_303,plain,
( ~ axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1))))
| ~ theorem(or(not(X0),X1))
| theorem(or(not(or(X2,X0)),or(X2,X1))) ),
inference(instantiation,[status(thm)],[c_252]) ).
cnf(c_399,plain,
( ~ axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2))))
| ~ theorem(or(not(or(X1,or(X0,X2))),or(p,or(q,r))))
| theorem(or(not(or(X0,or(X1,X2))),or(p,or(q,r)))) ),
inference(instantiation,[status(thm)],[c_264]) ).
cnf(c_459,plain,
( ~ axiom(or(not(or(not(X0),or(q,r))),or(not(or(p,X0)),or(p,or(q,r)))))
| ~ theorem(or(not(X0),or(q,r)))
| theorem(or(not(or(p,X0)),or(p,or(q,r)))) ),
inference(instantiation,[status(thm)],[c_303]) ).
cnf(c_474,plain,
axiom(or(not(or(not(X0),or(q,r))),or(not(or(p,X0)),or(p,or(q,r))))),
inference(instantiation,[status(thm)],[c_54]) ).
cnf(c_813,plain,
axiom(or(not(or(r,q)),or(q,r))),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_855,plain,
( ~ axiom(or(not(or(not(or(r,q)),or(q,r))),or(not(or(p,or(r,q))),or(p,or(q,r)))))
| ~ theorem(or(not(or(r,q)),or(q,r)))
| theorem(or(not(or(p,or(r,q))),or(p,or(q,r)))) ),
inference(instantiation,[status(thm)],[c_459]) ).
cnf(c_856,plain,
( ~ axiom(or(not(or(r,q)),or(q,r)))
| theorem(or(not(or(r,q)),or(q,r))) ),
inference(instantiation,[status(thm)],[c_243]) ).
cnf(c_1384,plain,
axiom(or(not(or(not(or(r,q)),or(q,r))),or(not(or(p,or(r,q))),or(p,or(q,r))))),
inference(instantiation,[status(thm)],[c_474]) ).
cnf(c_1620,plain,
( ~ theorem(or(not(or(r,or(p,q))),or(p,or(q,r))))
| ~ axiom(or(not(or(or(p,q),r)),or(r,or(p,q))))
| theorem(or(not(or(or(p,q),r)),or(p,or(q,r)))) ),
inference(instantiation,[status(thm)],[c_250]) ).
cnf(c_1621,plain,
axiom(or(not(or(or(p,q),r)),or(r,or(p,q)))),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_2357,plain,
( ~ theorem(or(not(or(p,or(r,q))),or(p,or(q,r))))
| ~ axiom(or(not(or(r,or(p,q))),or(p,or(r,q))))
| theorem(or(not(or(r,or(p,q))),or(p,or(q,r)))) ),
inference(instantiation,[status(thm)],[c_399]) ).
cnf(c_3727,plain,
axiom(or(not(or(r,or(p,q))),or(p,or(r,q)))),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_3728,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_3727,c_2357,c_1621,c_1620,c_1384,c_856,c_855,c_813,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : LCL192-1 : TPTP v8.1.2. Released v1.1.0.
% 0.09/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n016.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Thu May 2 19:51:30 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.19/0.45 Running first-order theorem proving
% 0.19/0.45 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.48/1.15 % SZS status Started for theBenchmark.p
% 0.48/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 0.48/1.15
% 0.48/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.48/1.15
% 0.48/1.15 ------ iProver source info
% 0.48/1.15
% 0.48/1.15 git: date: 2024-05-02 19:28:25 +0000
% 0.48/1.15 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.48/1.15 git: non_committed_changes: false
% 0.48/1.15
% 0.48/1.15 ------ Parsing...successful
% 0.48/1.15
% 0.48/1.15
% 0.48/1.15
% 0.48/1.15 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 0.48/1.15
% 0.48/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.48/1.15 ------ Proving...
% 0.48/1.15 ------ Problem Properties
% 0.48/1.15
% 0.48/1.15
% 0.48/1.15 clauses 9
% 0.48/1.15 conjectures 1
% 0.48/1.15 EPR 1
% 0.48/1.15 Horn 9
% 0.48/1.15 unary 6
% 0.48/1.15 binary 1
% 0.48/1.15 lits 14
% 0.48/1.15 lits eq 0
% 0.48/1.15 fd_pure 0
% 0.48/1.15 fd_pseudo 0
% 0.48/1.15 fd_cond 0
% 0.48/1.15 fd_pseudo_cond 0
% 0.48/1.15 AC symbols 0
% 0.48/1.15
% 0.48/1.15 ------ Input Options Time Limit: Unbounded
% 0.48/1.15
% 0.48/1.15
% 0.48/1.15 ------
% 0.48/1.15 Current options:
% 0.48/1.15 ------
% 0.48/1.15
% 0.48/1.15
% 0.48/1.15
% 0.48/1.15
% 0.48/1.15 ------ Proving...
% 0.48/1.15
% 0.48/1.15
% 0.48/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 0.48/1.15
% 0.48/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.48/1.15
% 0.48/1.15
%------------------------------------------------------------------------------