TSTP Solution File: LCL200-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL200-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n010.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:13 EDT 2024
% Result : Unsatisfiable 3.62s 1.17s
% Output : CNFRefutation 3.62s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
~ theorem(or(not(not(or(p,q))),not(q))),
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_57,plain,
( ~ theorem(or(not(X0),X1))
| ~ axiom(or(not(X2),X0))
| theorem(or(not(X2),X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_3) ).
cnf(c_216,plain,
or(p,q) = sP0_iProver_def,
definition ).
cnf(c_217,plain,
not(sP0_iProver_def) = sP1_iProver_def,
definition ).
cnf(c_218,plain,
not(sP1_iProver_def) = sP2_iProver_def,
definition ).
cnf(c_219,plain,
not(q) = sP3_iProver_def,
definition ).
cnf(c_220,plain,
or(sP2_iProver_def,sP3_iProver_def) = sP4_iProver_def,
definition ).
cnf(c_221,negated_conjecture,
~ theorem(sP4_iProver_def),
inference(demodulation,[status(thm)],[c_49,c_219,c_216,c_217,c_218,c_220]) ).
cnf(c_377,plain,
axiom(or(not(q),sP0_iProver_def)),
inference(superposition,[status(thm)],[c_216,c_51]) ).
cnf(c_379,plain,
theorem(or(not(X0),or(X1,X0))),
inference(superposition,[status(thm)],[c_51,c_55]) ).
cnf(c_380,plain,
axiom(or(sP3_iProver_def,sP0_iProver_def)),
inference(light_normalisation,[status(thm)],[c_377,c_219]) ).
cnf(c_387,plain,
axiom(or(not(or(sP3_iProver_def,sP2_iProver_def)),sP4_iProver_def)),
inference(superposition,[status(thm)],[c_220,c_52]) ).
cnf(c_396,plain,
( ~ theorem(or(X0,X0))
| theorem(X0) ),
inference(superposition,[status(thm)],[c_50,c_56]) ).
cnf(c_398,plain,
( ~ theorem(or(X0,X1))
| theorem(or(X1,X0)) ),
inference(superposition,[status(thm)],[c_52,c_56]) ).
cnf(c_424,plain,
( ~ theorem(or(X0,or(X1,X2)))
| theorem(or(X1,or(X0,X2))) ),
inference(superposition,[status(thm)],[c_53,c_56]) ).
cnf(c_551,plain,
( ~ theorem(or(sP3_iProver_def,sP2_iProver_def))
| theorem(sP4_iProver_def) ),
inference(superposition,[status(thm)],[c_387,c_56]) ).
cnf(c_552,plain,
~ theorem(or(sP3_iProver_def,sP2_iProver_def)),
inference(forward_subsumption_resolution,[status(thm)],[c_551,c_221]) ).
cnf(c_928,plain,
theorem(or(X0,or(not(X1),X1))),
inference(superposition,[status(thm)],[c_379,c_424]) ).
cnf(c_1173,plain,
theorem(or(not(X0),X0)),
inference(superposition,[status(thm)],[c_928,c_396]) ).
cnf(c_1182,plain,
theorem(or(X0,not(X0))),
inference(superposition,[status(thm)],[c_1173,c_398]) ).
cnf(c_1190,plain,
( ~ axiom(or(not(X0),X1))
| theorem(or(not(X0),not(not(X1)))) ),
inference(superposition,[status(thm)],[c_1182,c_57]) ).
cnf(c_4353,plain,
( ~ axiom(or(not(X0),sP0_iProver_def))
| theorem(or(not(X0),not(sP1_iProver_def))) ),
inference(superposition,[status(thm)],[c_217,c_1190]) ).
cnf(c_4363,plain,
( ~ axiom(or(not(X0),sP0_iProver_def))
| theorem(or(not(X0),sP2_iProver_def)) ),
inference(light_normalisation,[status(thm)],[c_4353,c_218]) ).
cnf(c_4414,plain,
( ~ axiom(or(sP3_iProver_def,sP0_iProver_def))
| theorem(or(not(q),sP2_iProver_def)) ),
inference(superposition,[status(thm)],[c_219,c_4363]) ).
cnf(c_4421,plain,
( ~ axiom(or(sP3_iProver_def,sP0_iProver_def))
| theorem(or(sP3_iProver_def,sP2_iProver_def)) ),
inference(light_normalisation,[status(thm)],[c_4414,c_219]) ).
cnf(c_4422,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_4421,c_552,c_380]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL200-1 : TPTP v8.1.2. Released v1.1.0.
% 0.14/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n010.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu May 2 18:41:34 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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
% 3.62/1.17 % SZS status Started for theBenchmark.p
% 3.62/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 3.62/1.17
% 3.62/1.17 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.62/1.17
% 3.62/1.17 ------ iProver source info
% 3.62/1.17
% 3.62/1.17 git: date: 2024-05-02 19:28:25 +0000
% 3.62/1.17 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.62/1.17 git: non_committed_changes: false
% 3.62/1.17
% 3.62/1.17 ------ Parsing...successful
% 3.62/1.17
% 3.62/1.17
% 3.62/1.17
% 3.62/1.17 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 3.62/1.17
% 3.62/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.62/1.17
% 3.62/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.62/1.17 ------ Proving...
% 3.62/1.17 ------ Problem Properties
% 3.62/1.17
% 3.62/1.17
% 3.62/1.17 clauses 14
% 3.62/1.17 conjectures 1
% 3.62/1.17 EPR 2
% 3.62/1.17 Horn 14
% 3.62/1.17 unary 11
% 3.62/1.17 binary 1
% 3.62/1.17 lits 19
% 3.62/1.17 lits eq 5
% 3.62/1.17 fd_pure 0
% 3.62/1.17 fd_pseudo 0
% 3.62/1.17 fd_cond 0
% 3.62/1.17 fd_pseudo_cond 0
% 3.62/1.17 AC symbols 0
% 3.62/1.17
% 3.62/1.17 ------ Schedule dynamic 5 is on
% 3.62/1.17
% 3.62/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.62/1.17
% 3.62/1.17
% 3.62/1.17 ------
% 3.62/1.17 Current options:
% 3.62/1.17 ------
% 3.62/1.17
% 3.62/1.17
% 3.62/1.17
% 3.62/1.17
% 3.62/1.17 ------ Proving...
% 3.62/1.17
% 3.62/1.17
% 3.62/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 3.62/1.17
% 3.62/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.62/1.17
% 3.62/1.17
%------------------------------------------------------------------------------