TSTP Solution File: LCL025-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL025-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n029.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 : Mon Jun 24 11:03:51 EDT 2024
% Result : Unsatisfiable 13.93s 2.72s
% Output : CNFRefutation 13.93s
% 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(X0,implies(X1,X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c0_2) ).
cnf(c_52,plain,
is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(implies(X0,X1),implies(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c0_6) ).
cnf(c_53,negated_conjecture,
~ is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_c0_1) ).
cnf(c_71,plain,
implies(a,b) = sP0_iProver_def,
definition ).
cnf(c_72,plain,
implies(b,c) = sP1_iProver_def,
definition ).
cnf(c_73,plain,
implies(a,c) = sP2_iProver_def,
definition ).
cnf(c_74,plain,
implies(sP1_iProver_def,sP2_iProver_def) = sP3_iProver_def,
definition ).
cnf(c_75,plain,
implies(sP0_iProver_def,sP3_iProver_def) = sP4_iProver_def,
definition ).
cnf(c_76,negated_conjecture,
~ is_a_theorem(sP4_iProver_def),
inference(demodulation,[status(thm)],[c_53,c_73,c_72,c_74,c_71,c_75]) ).
cnf(c_183,plain,
( ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,X0)) ),
inference(superposition,[status(thm)],[c_50,c_49]) ).
cnf(c_222,plain,
is_a_theorem(implies(implies(X0,sP1_iProver_def),implies(implies(X0,b),implies(X0,c)))),
inference(superposition,[status(thm)],[c_72,c_52]) ).
cnf(c_234,plain,
is_a_theorem(implies(implies(sP1_iProver_def,implies(X0,sP2_iProver_def)),implies(implies(sP1_iProver_def,X0),sP3_iProver_def))),
inference(superposition,[status(thm)],[c_74,c_52]) ).
cnf(c_235,plain,
is_a_theorem(implies(implies(sP0_iProver_def,implies(X0,sP3_iProver_def)),implies(implies(sP0_iProver_def,X0),sP4_iProver_def))),
inference(superposition,[status(thm)],[c_75,c_52]) ).
cnf(c_236,plain,
( ~ is_a_theorem(implies(X0,implies(X1,X2)))
| is_a_theorem(implies(implies(X0,X1),implies(X0,X2))) ),
inference(superposition,[status(thm)],[c_52,c_49]) ).
cnf(c_359,plain,
is_a_theorem(implies(implies(a,sP1_iProver_def),implies(implies(a,b),sP2_iProver_def))),
inference(superposition,[status(thm)],[c_73,c_222]) ).
cnf(c_361,plain,
is_a_theorem(implies(implies(a,sP1_iProver_def),implies(sP0_iProver_def,sP2_iProver_def))),
inference(light_normalisation,[status(thm)],[c_359,c_71]) ).
cnf(c_774,plain,
( ~ is_a_theorem(implies(sP1_iProver_def,implies(X0,sP2_iProver_def)))
| is_a_theorem(implies(implies(sP1_iProver_def,X0),sP3_iProver_def)) ),
inference(superposition,[status(thm)],[c_234,c_49]) ).
cnf(c_780,plain,
( ~ is_a_theorem(implies(sP0_iProver_def,implies(X0,sP3_iProver_def)))
| is_a_theorem(implies(implies(sP0_iProver_def,X0),sP4_iProver_def)) ),
inference(superposition,[status(thm)],[c_235,c_49]) ).
cnf(c_876,plain,
( ~ is_a_theorem(implies(X0,implies(X1,X2)))
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(implies(X0,X2)) ),
inference(superposition,[status(thm)],[c_236,c_49]) ).
cnf(c_1268,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_183,c_780]) ).
cnf(c_1387,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_1268,c_49]) ).
cnf(c_1388,plain,
( ~ is_a_theorem(implies(X0,sP3_iProver_def))
| ~ is_a_theorem(implies(sP0_iProver_def,X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1387,c_76]) ).
cnf(c_1672,plain,
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(implies(X2,X0))
| is_a_theorem(implies(X2,X1)) ),
inference(superposition,[status(thm)],[c_183,c_876]) ).
cnf(c_3047,plain,
( ~ is_a_theorem(implies(X0,implies(a,sP1_iProver_def)))
| is_a_theorem(implies(X0,implies(sP0_iProver_def,sP2_iProver_def))) ),
inference(superposition,[status(thm)],[c_361,c_1672]) ).
cnf(c_34663,plain,
is_a_theorem(implies(sP1_iProver_def,implies(sP0_iProver_def,sP2_iProver_def))),
inference(superposition,[status(thm)],[c_50,c_3047]) ).
cnf(c_34873,plain,
is_a_theorem(implies(implies(sP1_iProver_def,sP0_iProver_def),sP3_iProver_def)),
inference(superposition,[status(thm)],[c_34663,c_774]) ).
cnf(c_34900,plain,
~ is_a_theorem(implies(sP0_iProver_def,implies(sP1_iProver_def,sP0_iProver_def))),
inference(superposition,[status(thm)],[c_34873,c_1388]) ).
cnf(c_34903,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_34900,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : LCL025-1 : TPTP v8.2.0. Released v1.0.0.
% 0.08/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n029.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 : Sat Jun 22 12:00:09 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.22/0.51 Running first-order theorem proving
% 0.22/0.51 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
% 13.93/2.72 % SZS status Started for theBenchmark.p
% 13.93/2.72 % SZS status Unsatisfiable for theBenchmark.p
% 13.93/2.72
% 13.93/2.72 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 13.93/2.72
% 13.93/2.72 ------ iProver source info
% 13.93/2.72
% 13.93/2.72 git: date: 2024-06-12 09:56:46 +0000
% 13.93/2.72 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 13.93/2.72 git: non_committed_changes: false
% 13.93/2.72
% 13.93/2.72 ------ Parsing...successful
% 13.93/2.72
% 13.93/2.72
% 13.93/2.72
% 13.93/2.72 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 13.93/2.72
% 13.93/2.72 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 13.93/2.72
% 13.93/2.72 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 13.93/2.72 ------ Proving...
% 13.93/2.72 ------ Problem Properties
% 13.93/2.72
% 13.93/2.72
% 13.93/2.72 clauses 10
% 13.93/2.72 conjectures 1
% 13.93/2.72 EPR 1
% 13.93/2.72 Horn 10
% 13.93/2.72 unary 9
% 13.93/2.72 binary 0
% 13.93/2.72 lits 12
% 13.93/2.72 lits eq 5
% 13.93/2.72 fd_pure 0
% 13.93/2.72 fd_pseudo 0
% 13.93/2.72 fd_cond 0
% 13.93/2.72 fd_pseudo_cond 0
% 13.93/2.72 AC symbols 0
% 13.93/2.72
% 13.93/2.72 ------ Schedule dynamic 5 is on
% 13.93/2.72
% 13.93/2.72 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 13.93/2.72
% 13.93/2.72
% 13.93/2.72 ------
% 13.93/2.72 Current options:
% 13.93/2.72 ------
% 13.93/2.72
% 13.93/2.72
% 13.93/2.72
% 13.93/2.72
% 13.93/2.72 ------ Proving...
% 13.93/2.72
% 13.93/2.72
% 13.93/2.72 % SZS status Unsatisfiable for theBenchmark.p
% 13.93/2.72
% 13.93/2.72 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 13.93/2.72
% 13.93/2.72
%------------------------------------------------------------------------------