TSTP Solution File: LCL081-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL081-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n007.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:36:47 EDT 2024
% Result : Unsatisfiable 3.95s 1.19s
% Output : CNFRefutation 3.95s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(c_50,plain,
is_a_theorem(implies(implies(implies(X0,X1),X2),implies(implies(X2,X0),implies(X3,X0)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ic_JLukasiewicz) ).
cnf(c_51,negated_conjecture,
~ is_a_theorem(implies(a,a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ic_1) ).
cnf(c_63,plain,
implies(a,a) = sP0_iProver_def,
definition ).
cnf(c_64,negated_conjecture,
~ is_a_theorem(sP0_iProver_def),
inference(demodulation,[status(thm)],[c_51,c_63]) ).
cnf(c_143,plain,
is_a_theorem(implies(implies(sP0_iProver_def,X0),implies(implies(X0,a),implies(X1,a)))),
inference(superposition,[status(thm)],[c_63,c_50]) ).
cnf(c_146,plain,
( ~ is_a_theorem(implies(implies(X0,X1),X2))
| is_a_theorem(implies(implies(X2,X0),implies(X3,X0))) ),
inference(superposition,[status(thm)],[c_50,c_49]) ).
cnf(c_154,plain,
is_a_theorem(implies(implies(sP0_iProver_def,X0),implies(implies(X0,a),sP0_iProver_def))),
inference(superposition,[status(thm)],[c_63,c_143]) ).
cnf(c_185,plain,
( ~ is_a_theorem(implies(sP0_iProver_def,X0))
| is_a_theorem(implies(implies(X0,a),sP0_iProver_def)) ),
inference(superposition,[status(thm)],[c_154,c_49]) ).
cnf(c_269,plain,
is_a_theorem(implies(implies(implies(implies(X0,X1),implies(X2,X1)),implies(X1,X3)),implies(X4,implies(X1,X3)))),
inference(superposition,[status(thm)],[c_50,c_146]) ).
cnf(c_278,plain,
( ~ is_a_theorem(implies(sP0_iProver_def,X0))
| is_a_theorem(implies(implies(sP0_iProver_def,X0),implies(X1,X0))) ),
inference(superposition,[status(thm)],[c_185,c_146]) ).
cnf(c_347,plain,
( ~ is_a_theorem(implies(implies(implies(X0,X1),implies(X2,X1)),implies(X1,X3)))
| is_a_theorem(implies(X4,implies(X1,X3))) ),
inference(superposition,[status(thm)],[c_269,c_49]) ).
cnf(c_371,plain,
is_a_theorem(implies(X0,implies(implies(X1,X2),implies(X2,implies(X1,X2))))),
inference(superposition,[status(thm)],[c_269,c_347]) ).
cnf(c_392,plain,
is_a_theorem(implies(X0,implies(sP0_iProver_def,implies(a,sP0_iProver_def)))),
inference(superposition,[status(thm)],[c_63,c_371]) ).
cnf(c_444,plain,
( ~ is_a_theorem(X0)
| is_a_theorem(implies(sP0_iProver_def,implies(a,sP0_iProver_def))) ),
inference(superposition,[status(thm)],[c_392,c_49]) ).
cnf(c_467,plain,
is_a_theorem(implies(sP0_iProver_def,implies(a,sP0_iProver_def))),
inference(superposition,[status(thm)],[c_269,c_444]) ).
cnf(c_546,plain,
( ~ is_a_theorem(implies(sP0_iProver_def,X0))
| is_a_theorem(implies(X1,X0)) ),
inference(superposition,[status(thm)],[c_278,c_49]) ).
cnf(c_567,plain,
is_a_theorem(implies(X0,implies(a,sP0_iProver_def))),
inference(superposition,[status(thm)],[c_467,c_546]) ).
cnf(c_641,plain,
( ~ is_a_theorem(X0)
| is_a_theorem(implies(a,sP0_iProver_def)) ),
inference(superposition,[status(thm)],[c_567,c_49]) ).
cnf(c_642,plain,
is_a_theorem(implies(implies(implies(a,sP0_iProver_def),X0),implies(X1,X0))),
inference(superposition,[status(thm)],[c_567,c_146]) ).
cnf(c_703,plain,
is_a_theorem(implies(a,sP0_iProver_def)),
inference(superposition,[status(thm)],[c_371,c_641]) ).
cnf(c_819,plain,
is_a_theorem(implies(X0,implies(sP0_iProver_def,implies(X1,sP0_iProver_def)))),
inference(superposition,[status(thm)],[c_642,c_347]) ).
cnf(c_857,plain,
( ~ is_a_theorem(X0)
| is_a_theorem(implies(sP0_iProver_def,implies(X1,sP0_iProver_def))) ),
inference(superposition,[status(thm)],[c_819,c_49]) ).
cnf(c_894,plain,
is_a_theorem(implies(sP0_iProver_def,implies(X0,sP0_iProver_def))),
inference(superposition,[status(thm)],[c_703,c_857]) ).
cnf(c_1015,plain,
is_a_theorem(implies(X0,implies(X1,sP0_iProver_def))),
inference(superposition,[status(thm)],[c_894,c_546]) ).
cnf(c_1017,plain,
( ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,sP0_iProver_def)) ),
inference(superposition,[status(thm)],[c_1015,c_49]) ).
cnf(c_1045,plain,
is_a_theorem(implies(X0,sP0_iProver_def)),
inference(superposition,[status(thm)],[c_819,c_1017]) ).
cnf(c_1047,plain,
( ~ is_a_theorem(X0)
| is_a_theorem(sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_1045,c_49]) ).
cnf(c_1053,plain,
~ is_a_theorem(X0),
inference(forward_subsumption_resolution,[status(thm)],[c_1047,c_64]) ).
cnf(c_1054,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_1045,c_1053]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : LCL081-1 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n007.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu May 2 19:03:20 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/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.95/1.19 % SZS status Started for theBenchmark.p
% 3.95/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 3.95/1.19
% 3.95/1.19 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.95/1.19
% 3.95/1.19 ------ iProver source info
% 3.95/1.19
% 3.95/1.19 git: date: 2024-05-02 19:28:25 +0000
% 3.95/1.19 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.95/1.19 git: non_committed_changes: false
% 3.95/1.19
% 3.95/1.19 ------ Parsing...successful
% 3.95/1.19
% 3.95/1.19
% 3.95/1.19
% 3.95/1.19 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 3.95/1.19
% 3.95/1.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.95/1.19
% 3.95/1.19 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.95/1.19 ------ Proving...
% 3.95/1.19 ------ Problem Properties
% 3.95/1.19
% 3.95/1.19
% 3.95/1.19 clauses 4
% 3.95/1.19 conjectures 1
% 3.95/1.19 EPR 1
% 3.95/1.19 Horn 4
% 3.95/1.19 unary 3
% 3.95/1.19 binary 0
% 3.95/1.19 lits 6
% 3.95/1.19 lits eq 1
% 3.95/1.19 fd_pure 0
% 3.95/1.19 fd_pseudo 0
% 3.95/1.19 fd_cond 0
% 3.95/1.19 fd_pseudo_cond 0
% 3.95/1.19 AC symbols 0
% 3.95/1.19
% 3.95/1.19 ------ Schedule dynamic 5 is on
% 3.95/1.19
% 3.95/1.19 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.95/1.19
% 3.95/1.19
% 3.95/1.19 ------
% 3.95/1.19 Current options:
% 3.95/1.19 ------
% 3.95/1.19
% 3.95/1.19
% 3.95/1.19
% 3.95/1.19
% 3.95/1.19 ------ Proving...
% 3.95/1.19
% 3.95/1.19
% 3.95/1.19 % SZS status Unsatisfiable for theBenchmark.p
% 3.95/1.19
% 3.95/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.95/1.19
% 3.95/1.19
%------------------------------------------------------------------------------