TSTP Solution File: LCL110-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL110-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n018.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:52 EDT 2024
% Result : Unsatisfiable 0.47s 1.17s
% Output : CNFRefutation 0.47s
% 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/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(c_50,plain,
is_a_theorem(implies(X0,implies(X1,X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv_1) ).
cnf(c_51,plain,
is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv_2) ).
cnf(c_52,plain,
is_a_theorem(implies(implies(implies(X0,X1),X1),implies(implies(X1,X0),X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv_3) ).
cnf(c_53,plain,
is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv_5) ).
cnf(c_54,negated_conjecture,
~ is_a_theorem(implies(not(not(a)),a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_mv_24) ).
cnf(c_75,plain,
not(a) = sP0_iProver_def,
definition ).
cnf(c_76,plain,
not(sP0_iProver_def) = sP1_iProver_def,
definition ).
cnf(c_77,plain,
implies(sP1_iProver_def,a) = sP2_iProver_def,
definition ).
cnf(c_78,negated_conjecture,
~ is_a_theorem(sP2_iProver_def),
inference(demodulation,[status(thm)],[c_54,c_75,c_76,c_77]) ).
cnf(c_183,plain,
is_a_theorem(implies(a,sP2_iProver_def)),
inference(superposition,[status(thm)],[c_77,c_50]) ).
cnf(c_187,plain,
( ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,X0)) ),
inference(superposition,[status(thm)],[c_50,c_49]) ).
cnf(c_202,plain,
is_a_theorem(implies(implies(not(X0),sP1_iProver_def),implies(sP0_iProver_def,X0))),
inference(superposition,[status(thm)],[c_76,c_53]) ).
cnf(c_215,plain,
is_a_theorem(implies(implies(sP1_iProver_def,X0),implies(implies(X0,a),sP2_iProver_def))),
inference(superposition,[status(thm)],[c_77,c_51]) ).
cnf(c_216,plain,
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(implies(X1,X2),implies(X0,X2))) ),
inference(superposition,[status(thm)],[c_51,c_49]) ).
cnf(c_225,plain,
( ~ is_a_theorem(implies(implies(X0,X1),X1))
| is_a_theorem(implies(implies(X1,X0),X0)) ),
inference(superposition,[status(thm)],[c_52,c_49]) ).
cnf(c_441,plain,
( ~ is_a_theorem(implies(sP1_iProver_def,X0))
| is_a_theorem(implies(implies(X0,a),sP2_iProver_def)) ),
inference(superposition,[status(thm)],[c_215,c_49]) ).
cnf(c_527,plain,
( ~ is_a_theorem(implies(X0,a))
| ~ is_a_theorem(implies(sP1_iProver_def,X0))
| is_a_theorem(sP2_iProver_def) ),
inference(superposition,[status(thm)],[c_441,c_49]) ).
cnf(c_528,plain,
( ~ is_a_theorem(implies(X0,a))
| ~ is_a_theorem(implies(sP1_iProver_def,X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_527,c_78]) ).
cnf(c_561,plain,
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(implies(X0,X2)) ),
inference(superposition,[status(thm)],[c_216,c_49]) ).
cnf(c_592,plain,
( ~ is_a_theorem(X0)
| is_a_theorem(implies(implies(X0,X1),X1)) ),
inference(superposition,[status(thm)],[c_187,c_225]) ).
cnf(c_608,plain,
( ~ is_a_theorem(implies(implies(X0,X1),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(superposition,[status(thm)],[c_50,c_561]) ).
cnf(c_609,plain,
( ~ is_a_theorem(implies(implies(implies(X0,X1),implies(X2,X1)),X3))
| is_a_theorem(implies(implies(X2,X0),X3)) ),
inference(superposition,[status(thm)],[c_51,c_561]) ).
cnf(c_611,plain,
( ~ is_a_theorem(implies(implies(X0,X1),X2))
| is_a_theorem(implies(implies(not(X1),not(X0)),X2)) ),
inference(superposition,[status(thm)],[c_53,c_561]) ).
cnf(c_612,plain,
( ~ is_a_theorem(implies(sP2_iProver_def,X0))
| is_a_theorem(implies(a,X0)) ),
inference(superposition,[status(thm)],[c_183,c_561]) ).
cnf(c_811,plain,
is_a_theorem(implies(a,implies(X0,sP2_iProver_def))),
inference(superposition,[status(thm)],[c_50,c_612]) ).
cnf(c_970,plain,
is_a_theorem(implies(sP1_iProver_def,implies(sP0_iProver_def,X0))),
inference(superposition,[status(thm)],[c_202,c_608]) ).
cnf(c_977,plain,
( ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,X1)) ),
inference(superposition,[status(thm)],[c_592,c_608]) ).
cnf(c_1268,plain,
is_a_theorem(implies(X0,X0)),
inference(superposition,[status(thm)],[c_811,c_977]) ).
cnf(c_1329,plain,
is_a_theorem(implies(implies(X0,X1),implies(X2,implies(implies(X1,X3),implies(X0,X3))))),
inference(superposition,[status(thm)],[c_50,c_609]) ).
cnf(c_1427,plain,
is_a_theorem(implies(implies(X0,sP1_iProver_def),implies(X1,implies(sP2_iProver_def,implies(X0,a))))),
inference(superposition,[status(thm)],[c_77,c_1329]) ).
cnf(c_1704,plain,
is_a_theorem(implies(implies(sP1_iProver_def,sP1_iProver_def),implies(X0,implies(sP2_iProver_def,sP2_iProver_def)))),
inference(superposition,[status(thm)],[c_77,c_1427]) ).
cnf(c_1736,plain,
( ~ is_a_theorem(implies(sP1_iProver_def,sP1_iProver_def))
| is_a_theorem(implies(X0,implies(sP2_iProver_def,sP2_iProver_def))) ),
inference(superposition,[status(thm)],[c_1704,c_49]) ).
cnf(c_1738,plain,
is_a_theorem(implies(X0,implies(sP2_iProver_def,sP2_iProver_def))),
inference(forward_subsumption_resolution,[status(thm)],[c_1736,c_1268]) ).
cnf(c_1777,plain,
is_a_theorem(implies(implies(implies(sP2_iProver_def,sP2_iProver_def),X0),X0)),
inference(superposition,[status(thm)],[c_1738,c_225]) ).
cnf(c_1905,plain,
( ~ is_a_theorem(implies(sP1_iProver_def,implies(not(X0),not(X1))))
| ~ is_a_theorem(implies(implies(X1,X0),a)) ),
inference(superposition,[status(thm)],[c_611,c_528]) ).
cnf(c_2310,plain,
( ~ is_a_theorem(implies(sP1_iProver_def,implies(sP0_iProver_def,not(X0))))
| ~ is_a_theorem(implies(implies(X0,a),a)) ),
inference(superposition,[status(thm)],[c_75,c_1905]) ).
cnf(c_2321,plain,
~ is_a_theorem(implies(implies(X0,a),a)),
inference(forward_subsumption_resolution,[status(thm)],[c_2310,c_970]) ).
cnf(c_2383,plain,
$false,
inference(superposition,[status(thm)],[c_1777,c_2321]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL110-1 : TPTP v8.1.2. Released v1.0.0.
% 0.11/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n018.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:20:01 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 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.47/1.17 % SZS status Started for theBenchmark.p
% 0.47/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 0.47/1.17
% 0.47/1.17 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.47/1.17
% 0.47/1.17 ------ iProver source info
% 0.47/1.17
% 0.47/1.17 git: date: 2024-05-02 19:28:25 +0000
% 0.47/1.17 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.47/1.17 git: non_committed_changes: false
% 0.47/1.17
% 0.47/1.17 ------ Parsing...successful
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 0.47/1.17
% 0.47/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.47/1.17
% 0.47/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.47/1.17 ------ Proving...
% 0.47/1.17 ------ Problem Properties
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17 clauses 9
% 0.47/1.17 conjectures 1
% 0.47/1.17 EPR 1
% 0.47/1.17 Horn 9
% 0.47/1.17 unary 8
% 0.47/1.17 binary 0
% 0.47/1.17 lits 11
% 0.47/1.17 lits eq 3
% 0.47/1.17 fd_pure 0
% 0.47/1.17 fd_pseudo 0
% 0.47/1.17 fd_cond 0
% 0.47/1.17 fd_pseudo_cond 0
% 0.47/1.17 AC symbols 0
% 0.47/1.17
% 0.47/1.17 ------ Schedule dynamic 5 is on
% 0.47/1.17
% 0.47/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17 ------
% 0.47/1.17 Current options:
% 0.47/1.17 ------
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17 ------ Proving...
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 0.47/1.17
% 0.47/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.47/1.17
% 0.47/1.17
%------------------------------------------------------------------------------