TSTP Solution File: LCL043-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL043-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n026.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 0.48s 1.16s
% Output : CNFRefutation 0.48s
% 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(not(not(a)),a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_39) ).
cnf(c_79,plain,
not(a) = sP0_iProver_def,
definition ).
cnf(c_80,plain,
not(sP0_iProver_def) = sP1_iProver_def,
definition ).
cnf(c_81,plain,
implies(sP1_iProver_def,a) = sP2_iProver_def,
definition ).
cnf(c_82,negated_conjecture,
~ is_a_theorem(sP2_iProver_def),
inference(demodulation,[status(thm)],[c_55,c_79,c_80,c_81]) ).
cnf(c_193,plain,
is_a_theorem(implies(sP0_iProver_def,implies(sP1_iProver_def,X0))),
inference(superposition,[status(thm)],[c_80,c_50]) ).
cnf(c_215,plain,
is_a_theorem(implies(implies(a,X0),implies(implies(sP0_iProver_def,X0),X0))),
inference(superposition,[status(thm)],[c_79,c_54]) ).
cnf(c_225,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_232,plain,
is_a_theorem(implies(implies(X0,a),implies(implies(sP1_iProver_def,X0),sP2_iProver_def))),
inference(superposition,[status(thm)],[c_81,c_53]) ).
cnf(c_275,plain,
( ~ is_a_theorem(implies(a,X0))
| is_a_theorem(implies(implies(sP0_iProver_def,X0),X0)) ),
inference(superposition,[status(thm)],[c_215,c_49]) ).
cnf(c_278,plain,
( ~ is_a_theorem(implies(a,a))
| is_a_theorem(implies(implies(sP0_iProver_def,a),a)) ),
inference(instantiation,[status(thm)],[c_275]) ).
cnf(c_362,plain,
( ~ is_a_theorem(implies(X0,a))
| is_a_theorem(implies(implies(sP1_iProver_def,X0),sP2_iProver_def)) ),
inference(superposition,[status(thm)],[c_232,c_49]) ).
cnf(c_434,plain,
is_a_theorem(implies(not(X0),implies(X0,X1))),
inference(superposition,[status(thm)],[c_50,c_225]) ).
cnf(c_435,plain,
is_a_theorem(implies(X0,implies(X1,X1))),
inference(superposition,[status(thm)],[c_51,c_225]) ).
cnf(c_440,plain,
is_a_theorem(implies(sP1_iProver_def,implies(sP0_iProver_def,X0))),
inference(superposition,[status(thm)],[c_193,c_225]) ).
cnf(c_526,plain,
( ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,X1)) ),
inference(superposition,[status(thm)],[c_435,c_49]) ).
cnf(c_574,plain,
is_a_theorem(implies(X0,X0)),
inference(superposition,[status(thm)],[c_434,c_526]) ).
cnf(c_577,plain,
is_a_theorem(implies(a,a)),
inference(instantiation,[status(thm)],[c_574]) ).
cnf(c_703,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_362,c_49]) ).
cnf(c_704,plain,
( ~ is_a_theorem(implies(X0,a))
| ~ is_a_theorem(implies(sP1_iProver_def,X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_703,c_82]) ).
cnf(c_756,plain,
~ is_a_theorem(implies(implies(sP0_iProver_def,X0),a)),
inference(superposition,[status(thm)],[c_440,c_704]) ).
cnf(c_764,plain,
~ is_a_theorem(implies(implies(sP0_iProver_def,a),a)),
inference(instantiation,[status(thm)],[c_756]) ).
cnf(c_765,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_764,c_577,c_278]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL043-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n026.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.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 2 19:38:21 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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.48/1.16 % SZS status Started for theBenchmark.p
% 0.48/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 0.48/1.16
% 0.48/1.16 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.48/1.16
% 0.48/1.16 ------ iProver source info
% 0.48/1.16
% 0.48/1.16 git: date: 2024-05-02 19:28:25 +0000
% 0.48/1.16 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.48/1.16 git: non_committed_changes: false
% 0.48/1.16
% 0.48/1.16 ------ Parsing...successful
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 0.48/1.16
% 0.48/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.48/1.16
% 0.48/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.48/1.16 ------ Proving...
% 0.48/1.16 ------ Problem Properties
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 clauses 10
% 0.48/1.16 conjectures 1
% 0.48/1.16 EPR 1
% 0.48/1.16 Horn 10
% 0.48/1.16 unary 9
% 0.48/1.16 binary 0
% 0.48/1.16 lits 12
% 0.48/1.16 lits eq 3
% 0.48/1.16 fd_pure 0
% 0.48/1.16 fd_pseudo 0
% 0.48/1.16 fd_cond 0
% 0.48/1.16 fd_pseudo_cond 0
% 0.48/1.16 AC symbols 0
% 0.48/1.16
% 0.48/1.16 ------ Schedule dynamic 5 is on
% 0.48/1.16
% 0.48/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 ------
% 0.48/1.16 Current options:
% 0.48/1.16 ------
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 ------ Proving...
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 % SZS status Unsatisfiable for theBenchmark.p
% 0.48/1.16
% 0.48/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.48/1.16
% 0.48/1.16
%------------------------------------------------------------------------------