TSTP Solution File: LCL045-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL045-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n006.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:40 EDT 2024
% Result : Unsatisfiable 3.89s 1.12s
% Output : CNFRefutation 3.89s
% 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(not(X0),X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_3) ).
cnf(c_51,plain,
is_a_theorem(implies(X0,implies(X1,X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_18) ).
cnf(c_52,plain,
is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(X1,implies(X0,X2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_21) ).
cnf(c_53,plain,
is_a_theorem(implies(implies(X0,X1),implies(implies(X2,X0),implies(X2,X1)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_22) ).
cnf(c_54,plain,
is_a_theorem(implies(implies(X0,X1),implies(implies(not(X0),X1),X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_54) ).
cnf(c_55,negated_conjecture,
~ is_a_theorem(implies(implies(a,b),implies(not(b),not(a)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_46) ).
cnf(c_79,plain,
implies(a,b) = sP0_iProver_def,
definition ).
cnf(c_80,plain,
not(b) = sP1_iProver_def,
definition ).
cnf(c_81,plain,
not(a) = sP2_iProver_def,
definition ).
cnf(c_82,plain,
implies(sP1_iProver_def,sP2_iProver_def) = sP3_iProver_def,
definition ).
cnf(c_83,plain,
implies(sP0_iProver_def,sP3_iProver_def) = sP4_iProver_def,
definition ).
cnf(c_84,negated_conjecture,
~ is_a_theorem(sP4_iProver_def),
inference(demodulation,[status(thm)],[c_55,c_81,c_80,c_82,c_79,c_83]) ).
cnf(c_202,plain,
is_a_theorem(implies(sP2_iProver_def,sP3_iProver_def)),
inference(superposition,[status(thm)],[c_82,c_51]) ).
cnf(c_204,plain,
is_a_theorem(implies(b,implies(sP1_iProver_def,X0))),
inference(superposition,[status(thm)],[c_80,c_50]) ).
cnf(c_238,plain,
is_a_theorem(implies(implies(a,X0),implies(implies(sP2_iProver_def,X0),X0))),
inference(superposition,[status(thm)],[c_81,c_54]) ).
cnf(c_252,plain,
is_a_theorem(implies(implies(X0,sP4_iProver_def),implies(sP0_iProver_def,implies(X0,sP3_iProver_def)))),
inference(superposition,[status(thm)],[c_83,c_52]) ).
cnf(c_255,plain,
is_a_theorem(implies(implies(sP0_iProver_def,implies(X0,sP3_iProver_def)),implies(X0,sP4_iProver_def))),
inference(superposition,[status(thm)],[c_83,c_52]) ).
cnf(c_256,plain,
( ~ is_a_theorem(implies(X0,implies(X1,X2)))
| is_a_theorem(implies(X1,implies(X0,X2))) ),
inference(superposition,[status(thm)],[c_52,c_49]) ).
cnf(c_285,plain,
is_a_theorem(implies(b,sP3_iProver_def)),
inference(superposition,[status(thm)],[c_82,c_204]) ).
cnf(c_328,plain,
is_a_theorem(implies(implies(b,X0),implies(sP0_iProver_def,implies(a,X0)))),
inference(superposition,[status(thm)],[c_79,c_53]) ).
cnf(c_333,plain,
is_a_theorem(implies(implies(X0,sP3_iProver_def),implies(implies(sP0_iProver_def,X0),sP4_iProver_def))),
inference(superposition,[status(thm)],[c_83,c_53]) ).
cnf(c_466,plain,
( ~ is_a_theorem(implies(X0,sP4_iProver_def))
| is_a_theorem(implies(sP0_iProver_def,implies(X0,sP3_iProver_def))) ),
inference(superposition,[status(thm)],[c_252,c_49]) ).
cnf(c_469,plain,
( ~ is_a_theorem(implies(a,sP4_iProver_def))
| is_a_theorem(implies(sP0_iProver_def,implies(a,sP3_iProver_def))) ),
inference(instantiation,[status(thm)],[c_466]) ).
cnf(c_487,plain,
( ~ is_a_theorem(implies(sP0_iProver_def,implies(X0,sP3_iProver_def)))
| is_a_theorem(implies(X0,sP4_iProver_def)) ),
inference(superposition,[status(thm)],[c_255,c_49]) ).
cnf(c_525,plain,
( ~ is_a_theorem(implies(b,X0))
| is_a_theorem(implies(sP0_iProver_def,implies(a,X0))) ),
inference(superposition,[status(thm)],[c_328,c_49]) ).
cnf(c_565,plain,
is_a_theorem(implies(implies(sP2_iProver_def,X0),implies(implies(a,X0),X0))),
inference(superposition,[status(thm)],[c_238,c_256]) ).
cnf(c_924,plain,
( ~ is_a_theorem(implies(X0,sP3_iProver_def))
| is_a_theorem(implies(implies(sP0_iProver_def,X0),sP4_iProver_def)) ),
inference(superposition,[status(thm)],[c_333,c_49]) ).
cnf(c_1114,plain,
( ~ is_a_theorem(implies(sP2_iProver_def,X0))
| is_a_theorem(implies(implies(a,X0),X0)) ),
inference(superposition,[status(thm)],[c_565,c_49]) ).
cnf(c_1686,plain,
( ~ is_a_theorem(implies(b,sP3_iProver_def))
| is_a_theorem(implies(a,sP4_iProver_def)) ),
inference(superposition,[status(thm)],[c_525,c_487]) ).
cnf(c_1687,plain,
is_a_theorem(implies(a,sP4_iProver_def)),
inference(forward_subsumption_resolution,[status(thm)],[c_1686,c_285]) ).
cnf(c_2120,plain,
( ~ is_a_theorem(implies(X0,sP3_iProver_def))
| ~ is_a_theorem(implies(sP0_iProver_def,X0))
| is_a_theorem(sP4_iProver_def) ),
inference(superposition,[status(thm)],[c_924,c_49]) ).
cnf(c_2121,plain,
( ~ is_a_theorem(implies(X0,sP3_iProver_def))
| ~ is_a_theorem(implies(sP0_iProver_def,X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2120,c_84]) ).
cnf(c_2452,plain,
( ~ is_a_theorem(implies(sP0_iProver_def,implies(a,sP3_iProver_def)))
| ~ is_a_theorem(implies(sP2_iProver_def,sP3_iProver_def)) ),
inference(superposition,[status(thm)],[c_1114,c_2121]) ).
cnf(c_2461,plain,
~ is_a_theorem(implies(sP0_iProver_def,implies(a,sP3_iProver_def))),
inference(forward_subsumption_resolution,[status(thm)],[c_2452,c_202]) ).
cnf(c_2464,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2461,c_1687,c_469]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : LCL045-1 : TPTP v8.1.2. Released v1.0.0.
% 0.05/0.11 % Command : run_iprover %s %d THM
% 0.11/0.31 % Computer : n006.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Thu May 2 18:58:19 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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
% 3.89/1.12 % SZS status Started for theBenchmark.p
% 3.89/1.12 % SZS status Unsatisfiable for theBenchmark.p
% 3.89/1.12
% 3.89/1.12 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.89/1.12
% 3.89/1.12 ------ iProver source info
% 3.89/1.12
% 3.89/1.12 git: date: 2024-05-02 19:28:25 +0000
% 3.89/1.12 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.89/1.12 git: non_committed_changes: false
% 3.89/1.12
% 3.89/1.12 ------ Parsing...successful
% 3.89/1.12
% 3.89/1.12
% 3.89/1.12
% 3.89/1.12 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 3.89/1.12
% 3.89/1.12 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.89/1.12
% 3.89/1.12 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.89/1.12 ------ Proving...
% 3.89/1.12 ------ Problem Properties
% 3.89/1.12
% 3.89/1.12
% 3.89/1.12 clauses 12
% 3.89/1.12 conjectures 1
% 3.89/1.12 EPR 1
% 3.89/1.12 Horn 12
% 3.89/1.12 unary 11
% 3.89/1.12 binary 0
% 3.89/1.12 lits 14
% 3.89/1.12 lits eq 5
% 3.89/1.12 fd_pure 0
% 3.89/1.12 fd_pseudo 0
% 3.89/1.12 fd_cond 0
% 3.89/1.12 fd_pseudo_cond 0
% 3.89/1.12 AC symbols 0
% 3.89/1.12
% 3.89/1.12 ------ Schedule dynamic 5 is on
% 3.89/1.12
% 3.89/1.12 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.89/1.12
% 3.89/1.12
% 3.89/1.12 ------
% 3.89/1.12 Current options:
% 3.89/1.12 ------
% 3.89/1.12
% 3.89/1.12
% 3.89/1.12
% 3.89/1.12
% 3.89/1.12 ------ Proving...
% 3.89/1.12
% 3.89/1.12
% 3.89/1.12 % SZS status Unsatisfiable for theBenchmark.p
% 3.89/1.12
% 3.89/1.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.89/1.12
% 3.89/1.12
%------------------------------------------------------------------------------