TSTP Solution File: LCL178-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL178-1 : TPTP v8.1.2. Released v1.1.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 : Fri May 3 02:37:05 EDT 2024
% Result : Unsatisfiable 2.22s 1.15s
% Output : CNFRefutation 2.22s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(or(not(p),not(not(p)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_50,plain,
axiom(or(not(or(X0,X0)),X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_2) ).
cnf(c_51,plain,
axiom(or(not(X0),or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_3) ).
cnf(c_52,plain,
axiom(or(not(or(X0,X1)),or(X1,X0))),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_5) ).
cnf(c_55,plain,
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_1) ).
cnf(c_56,plain,
( ~ axiom(or(not(X0),X1))
| ~ theorem(X0)
| theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_2) ).
cnf(c_216,plain,
not(p) = sP0_iProver_def,
definition ).
cnf(c_217,plain,
not(sP0_iProver_def) = sP1_iProver_def,
definition ).
cnf(c_218,plain,
or(sP0_iProver_def,sP1_iProver_def) = sP2_iProver_def,
definition ).
cnf(c_219,negated_conjecture,
~ theorem(sP2_iProver_def),
inference(demodulation,[status(thm)],[c_49,c_217,c_216,c_218]) ).
cnf(c_365,plain,
axiom(or(sP1_iProver_def,or(X0,sP0_iProver_def))),
inference(superposition,[status(thm)],[c_217,c_51]) ).
cnf(c_372,plain,
axiom(or(not(or(sP1_iProver_def,sP0_iProver_def)),sP2_iProver_def)),
inference(superposition,[status(thm)],[c_218,c_52]) ).
cnf(c_380,plain,
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(superposition,[status(thm)],[c_50,c_56]) ).
cnf(c_403,plain,
( ~ theorem(or(X0,or(X1,X2)))
| theorem(or(X1,or(X0,X2))) ),
inference(superposition,[status(thm)],[c_53,c_56]) ).
cnf(c_431,plain,
theorem(or(sP1_iProver_def,or(X0,sP0_iProver_def))),
inference(superposition,[status(thm)],[c_365,c_55]) ).
cnf(c_439,plain,
( ~ theorem(or(sP1_iProver_def,sP0_iProver_def))
| theorem(sP2_iProver_def) ),
inference(superposition,[status(thm)],[c_372,c_56]) ).
cnf(c_440,plain,
~ theorem(or(sP1_iProver_def,sP0_iProver_def)),
inference(forward_subsumption_resolution,[status(thm)],[c_439,c_219]) ).
cnf(c_804,plain,
theorem(or(X0,or(sP1_iProver_def,sP0_iProver_def))),
inference(superposition,[status(thm)],[c_431,c_403]) ).
cnf(c_902,plain,
theorem(or(sP1_iProver_def,sP0_iProver_def)),
inference(superposition,[status(thm)],[c_804,c_380]) ).
cnf(c_905,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_902,c_440]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LCL178-1 : TPTP v8.1.2. Released v1.1.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n028.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 19:29:33 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.22/1.15 % SZS status Started for theBenchmark.p
% 2.22/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 2.22/1.15
% 2.22/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.22/1.15
% 2.22/1.15 ------ iProver source info
% 2.22/1.15
% 2.22/1.15 git: date: 2024-05-02 19:28:25 +0000
% 2.22/1.15 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.22/1.15 git: non_committed_changes: false
% 2.22/1.15
% 2.22/1.15 ------ Parsing...successful
% 2.22/1.15
% 2.22/1.15
% 2.22/1.15
% 2.22/1.15 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 2.22/1.15
% 2.22/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.22/1.15
% 2.22/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.22/1.15 ------ Proving...
% 2.22/1.15 ------ Problem Properties
% 2.22/1.15
% 2.22/1.15
% 2.22/1.15 clauses 12
% 2.22/1.15 conjectures 1
% 2.22/1.15 EPR 2
% 2.22/1.15 Horn 12
% 2.22/1.15 unary 9
% 2.22/1.15 binary 1
% 2.22/1.15 lits 17
% 2.22/1.15 lits eq 3
% 2.22/1.15 fd_pure 0
% 2.22/1.15 fd_pseudo 0
% 2.22/1.15 fd_cond 0
% 2.22/1.15 fd_pseudo_cond 0
% 2.22/1.15 AC symbols 0
% 2.22/1.15
% 2.22/1.15 ------ Schedule dynamic 5 is on
% 2.22/1.15
% 2.22/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.22/1.15
% 2.22/1.15
% 2.22/1.15 ------
% 2.22/1.15 Current options:
% 2.22/1.15 ------
% 2.22/1.15
% 2.22/1.15
% 2.22/1.15
% 2.22/1.15
% 2.22/1.15 ------ Proving...
% 2.22/1.15
% 2.22/1.15
% 2.22/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 2.22/1.15
% 2.22/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.22/1.15
% 2.22/1.15
%------------------------------------------------------------------------------