TSTP Solution File: LCL193-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL193-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n019.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:02 EDT 2023
% Result : Unsatisfiable 2.84s 1.10s
% Output : CNFRefutation 2.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 19 ( 8 unt; 0 nHn; 16 RR)
% Number of literals : 38 ( 0 equ; 20 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 7 ( 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 : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(or(not(or(not(q),r)),or(not(or(p,q)),or(r,p)))),
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_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_218,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_221,plain,
( ~ theorem(or(not(X0),or(not(or(p,q)),or(r,p))))
| ~ axiom(or(not(or(not(q),r)),X0))
| theorem(or(not(or(not(q),r)),or(not(or(p,q)),or(r,p)))) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_223,plain,
( ~ axiom(or(not(or(not(X0),X1)),X2))
| ~ theorem(or(not(X0),X1))
| theorem(X2) ),
inference(instantiation,[status(thm)],[c_56]) ).
cnf(c_231,plain,
( ~ theorem(or(not(or(not(or(X0,q)),or(X0,r))),or(not(or(p,q)),or(r,p))))
| ~ axiom(or(not(or(not(q),r)),or(not(or(X0,q)),or(X0,r))))
| theorem(or(not(or(not(q),r)),or(not(or(p,q)),or(r,p)))) ),
inference(instantiation,[status(thm)],[c_221]) ).
cnf(c_232,plain,
axiom(or(not(or(not(q),r)),or(not(or(X0,q)),or(X0,r)))),
inference(instantiation,[status(thm)],[c_54]) ).
cnf(c_233,plain,
( ~ theorem(or(not(or(not(or(p,q)),or(p,r))),or(not(or(p,q)),or(r,p))))
| ~ axiom(or(not(or(not(q),r)),or(not(or(p,q)),or(p,r))))
| theorem(or(not(or(not(q),r)),or(not(or(p,q)),or(r,p)))) ),
inference(instantiation,[status(thm)],[c_231]) ).
cnf(c_234,plain,
axiom(or(not(or(not(q),r)),or(not(or(p,q)),or(p,r)))),
inference(instantiation,[status(thm)],[c_232]) ).
cnf(c_253,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_223]) ).
cnf(c_304,plain,
( ~ axiom(or(not(or(not(or(p,r)),or(r,p))),or(not(or(not(or(p,q)),or(p,r))),or(not(or(p,q)),or(r,p)))))
| ~ theorem(or(not(or(p,r)),or(r,p)))
| theorem(or(not(or(not(or(p,q)),or(p,r))),or(not(or(p,q)),or(r,p)))) ),
inference(instantiation,[status(thm)],[c_253]) ).
cnf(c_334,plain,
( ~ axiom(or(not(or(p,r)),or(r,p)))
| theorem(or(not(or(p,r)),or(r,p))) ),
inference(instantiation,[status(thm)],[c_218]) ).
cnf(c_591,plain,
axiom(or(not(or(p,r)),or(r,p))),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_1101,plain,
axiom(or(not(or(not(or(p,r)),or(r,p))),or(not(or(not(or(p,q)),or(p,r))),or(not(or(p,q)),or(r,p))))),
inference(instantiation,[status(thm)],[c_54]) ).
cnf(c_1102,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1101,c_591,c_334,c_304,c_234,c_233,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : LCL193-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.10 % Command : run_iprover %s %d THM
% 0.09/0.30 % Computer : n019.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Fri Aug 25 05:27:13 EDT 2023
% 0.09/0.31 % CPUTime :
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.84/1.10 % SZS status Started for theBenchmark.p
% 2.84/1.10 % SZS status Unsatisfiable for theBenchmark.p
% 2.84/1.10
% 2.84/1.10 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.84/1.10
% 2.84/1.10 ------ iProver source info
% 2.84/1.10
% 2.84/1.10 git: date: 2023-05-31 18:12:56 +0000
% 2.84/1.10 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.84/1.10 git: non_committed_changes: false
% 2.84/1.10 git: last_make_outside_of_git: false
% 2.84/1.10
% 2.84/1.10 ------ Parsing...successful
% 2.84/1.10
% 2.84/1.10
% 2.84/1.10
% 2.84/1.10 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 2.84/1.10
% 2.84/1.10 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.84/1.10 ------ Proving...
% 2.84/1.10 ------ Problem Properties
% 2.84/1.10
% 2.84/1.10
% 2.84/1.10 clauses 9
% 2.84/1.10 conjectures 1
% 2.84/1.10 EPR 1
% 2.84/1.10 Horn 9
% 2.84/1.10 unary 6
% 2.84/1.10 binary 1
% 2.84/1.10 lits 14
% 2.84/1.10 lits eq 0
% 2.84/1.10 fd_pure 0
% 2.84/1.10 fd_pseudo 0
% 2.84/1.10 fd_cond 0
% 2.84/1.10 fd_pseudo_cond 0
% 2.84/1.10 AC symbols 0
% 2.84/1.10
% 2.84/1.10 ------ Schedule dynamic 5 is on
% 2.84/1.10
% 2.84/1.10 ------ no equalities: superposition off
% 2.84/1.10
% 2.84/1.10 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.84/1.10
% 2.84/1.10
% 2.84/1.10 ------
% 2.84/1.10 Current options:
% 2.84/1.10 ------
% 2.84/1.10
% 2.84/1.10
% 2.84/1.10
% 2.84/1.10
% 2.84/1.10 ------ Proving...
% 2.84/1.10
% 2.84/1.10
% 2.84/1.10 % SZS status Unsatisfiable for theBenchmark.p
% 2.84/1.10
% 2.84/1.10 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.84/1.10
% 2.84/1.10
%------------------------------------------------------------------------------