TSTP Solution File: LCL358-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL358-1 : TPTP v8.1.2. Released v2.3.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:37:41 EDT 2024
% Result : Unsatisfiable 2.91s 1.15s
% Output : CNFRefutation 2.91s
% 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(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_1) ).
cnf(c_53,negated_conjecture,
~ is_a_theorem(implies(implies(x,implies(implies(y,z),u)),implies(implies(y,v),implies(x,implies(implies(v,z),u))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_07) ).
cnf(c_71,plain,
implies(y,z) = sP0_iProver_def,
definition ).
cnf(c_72,plain,
implies(sP0_iProver_def,u) = sP1_iProver_def,
definition ).
cnf(c_73,plain,
implies(x,sP1_iProver_def) = sP2_iProver_def,
definition ).
cnf(c_74,plain,
implies(y,v) = sP3_iProver_def,
definition ).
cnf(c_75,plain,
implies(v,z) = sP4_iProver_def,
definition ).
cnf(c_76,plain,
implies(sP4_iProver_def,u) = sP5_iProver_def,
definition ).
cnf(c_77,plain,
implies(x,sP5_iProver_def) = sP6_iProver_def,
definition ).
cnf(c_78,plain,
implies(sP3_iProver_def,sP6_iProver_def) = sP7_iProver_def,
definition ).
cnf(c_79,plain,
implies(sP2_iProver_def,sP7_iProver_def) = sP8_iProver_def,
definition ).
cnf(c_80,negated_conjecture,
~ is_a_theorem(sP8_iProver_def),
inference(demodulation,[status(thm)],[c_53,c_75,c_76,c_77,c_74,c_78,c_71,c_72,c_73,c_79]) ).
cnf(c_307,plain,
is_a_theorem(implies(sP3_iProver_def,implies(implies(v,X0),implies(y,X0)))),
inference(superposition,[status(thm)],[c_74,c_50]) ).
cnf(c_310,plain,
is_a_theorem(implies(sP2_iProver_def,implies(implies(sP1_iProver_def,X0),implies(x,X0)))),
inference(superposition,[status(thm)],[c_73,c_50]) ).
cnf(c_318,plain,
is_a_theorem(implies(implies(X0,sP0_iProver_def),implies(sP1_iProver_def,implies(X0,u)))),
inference(superposition,[status(thm)],[c_72,c_50]) ).
cnf(c_331,plain,
is_a_theorem(implies(implies(sP3_iProver_def,X0),implies(implies(X0,sP6_iProver_def),sP7_iProver_def))),
inference(superposition,[status(thm)],[c_78,c_50]) ).
cnf(c_332,plain,
is_a_theorem(implies(implies(sP2_iProver_def,X0),implies(implies(X0,sP7_iProver_def),sP8_iProver_def))),
inference(superposition,[status(thm)],[c_79,c_50]) ).
cnf(c_333,plain,
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(implies(X1,X2),implies(X0,X2))) ),
inference(superposition,[status(thm)],[c_50,c_49]) ).
cnf(c_432,plain,
is_a_theorem(implies(sP3_iProver_def,implies(implies(v,z),sP0_iProver_def))),
inference(superposition,[status(thm)],[c_71,c_307]) ).
cnf(c_435,plain,
is_a_theorem(implies(sP3_iProver_def,implies(sP4_iProver_def,sP0_iProver_def))),
inference(light_normalisation,[status(thm)],[c_432,c_75]) ).
cnf(c_549,plain,
is_a_theorem(implies(sP2_iProver_def,implies(implies(sP1_iProver_def,sP5_iProver_def),sP6_iProver_def))),
inference(superposition,[status(thm)],[c_77,c_310]) ).
cnf(c_771,plain,
is_a_theorem(implies(implies(sP4_iProver_def,sP0_iProver_def),implies(sP1_iProver_def,sP5_iProver_def))),
inference(superposition,[status(thm)],[c_76,c_318]) ).
cnf(c_1022,plain,
( ~ is_a_theorem(implies(sP3_iProver_def,X0))
| is_a_theorem(implies(implies(X0,sP6_iProver_def),sP7_iProver_def)) ),
inference(superposition,[status(thm)],[c_331,c_49]) ).
cnf(c_1028,plain,
( ~ is_a_theorem(implies(sP2_iProver_def,X0))
| is_a_theorem(implies(implies(X0,sP7_iProver_def),sP8_iProver_def)) ),
inference(superposition,[status(thm)],[c_332,c_49]) ).
cnf(c_1113,plain,
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(implies(X0,X2)) ),
inference(superposition,[status(thm)],[c_333,c_49]) ).
cnf(c_1439,plain,
( ~ is_a_theorem(implies(X0,sP7_iProver_def))
| ~ is_a_theorem(implies(sP2_iProver_def,X0))
| is_a_theorem(sP8_iProver_def) ),
inference(superposition,[status(thm)],[c_1028,c_49]) ).
cnf(c_1440,plain,
( ~ is_a_theorem(implies(X0,sP7_iProver_def))
| ~ is_a_theorem(implies(sP2_iProver_def,X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1439,c_80]) ).
cnf(c_1451,plain,
~ is_a_theorem(implies(implies(implies(sP1_iProver_def,sP5_iProver_def),sP6_iProver_def),sP7_iProver_def)),
inference(superposition,[status(thm)],[c_549,c_1440]) ).
cnf(c_1460,plain,
~ is_a_theorem(implies(sP3_iProver_def,implies(sP1_iProver_def,sP5_iProver_def))),
inference(superposition,[status(thm)],[c_1022,c_1451]) ).
cnf(c_1765,plain,
( ~ is_a_theorem(implies(implies(sP4_iProver_def,sP0_iProver_def),X0))
| is_a_theorem(implies(sP3_iProver_def,X0)) ),
inference(superposition,[status(thm)],[c_435,c_1113]) ).
cnf(c_2689,plain,
is_a_theorem(implies(sP3_iProver_def,implies(sP1_iProver_def,sP5_iProver_def))),
inference(superposition,[status(thm)],[c_771,c_1765]) ).
cnf(c_2690,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2689,c_1460]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL358-1 : TPTP v8.1.2. Released v2.3.0.
% 0.03/0.13 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n006.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % 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:02:19 EDT 2024
% 0.14/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
% 2.91/1.15 % SZS status Started for theBenchmark.p
% 2.91/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 2.91/1.15
% 2.91/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.91/1.15
% 2.91/1.15 ------ iProver source info
% 2.91/1.15
% 2.91/1.15 git: date: 2024-05-02 19:28:25 +0000
% 2.91/1.15 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.91/1.15 git: non_committed_changes: false
% 2.91/1.15
% 2.91/1.15 ------ Parsing...successful
% 2.91/1.15
% 2.91/1.15
% 2.91/1.15
% 2.91/1.15 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 2.91/1.15
% 2.91/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.91/1.15
% 2.91/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.91/1.15 ------ Proving...
% 2.91/1.15 ------ Problem Properties
% 2.91/1.15
% 2.91/1.15
% 2.91/1.15 clauses 14
% 2.91/1.15 conjectures 1
% 2.91/1.15 EPR 1
% 2.91/1.15 Horn 14
% 2.91/1.15 unary 13
% 2.91/1.15 binary 0
% 2.91/1.15 lits 16
% 2.91/1.15 lits eq 9
% 2.91/1.15 fd_pure 0
% 2.91/1.15 fd_pseudo 0
% 2.91/1.15 fd_cond 0
% 2.91/1.15 fd_pseudo_cond 0
% 2.91/1.15 AC symbols 0
% 2.91/1.15
% 2.91/1.15 ------ Schedule dynamic 5 is on
% 2.91/1.15
% 2.91/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.91/1.15
% 2.91/1.15
% 2.91/1.15 ------
% 2.91/1.15 Current options:
% 2.91/1.15 ------
% 2.91/1.15
% 2.91/1.15
% 2.91/1.15
% 2.91/1.15
% 2.91/1.15 ------ Proving...
% 2.91/1.15
% 2.91/1.15
% 2.91/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 2.91/1.15
% 2.91/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.91/1.15
% 2.91/1.15
%------------------------------------------------------------------------------