TSTP Solution File: LCL025-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL025-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:37 EDT 2024
% Result : Unsatisfiable 10.02s 2.20s
% Output : CNFRefutation 10.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of clauses : 14 ( 5 unt; 0 nHn; 10 RR)
% Number of literals : 28 ( 0 equ; 15 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 38 ( 2 sgn)
% 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_74,plain,
( ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,X0)) ),
inference(superposition,[status(thm)],[c_50,c_49]) ).
cnf(c_78,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_102,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_78,c_49]) ).
cnf(c_118,plain,
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(implies(X2,X0))
| is_a_theorem(implies(X2,X1)) ),
inference(superposition,[status(thm)],[c_74,c_102]) ).
cnf(c_160,plain,
( ~ is_a_theorem(implies(X0,implies(X1,implies(X2,X3))))
| is_a_theorem(implies(X0,implies(implies(X1,X2),implies(X1,X3)))) ),
inference(superposition,[status(thm)],[c_52,c_118]) ).
cnf(c_162,plain,
( ~ is_a_theorem(implies(X0,implies(X1,X2)))
| ~ is_a_theorem(implies(X3,implies(X0,X1)))
| is_a_theorem(implies(X3,implies(X0,X2))) ),
inference(superposition,[status(thm)],[c_78,c_118]) ).
cnf(c_293,plain,
( ~ is_a_theorem(implies(X0,implies(X1,implies(X2,X3))))
| ~ is_a_theorem(implies(X4,implies(X0,implies(X1,X2))))
| is_a_theorem(implies(X4,implies(X0,implies(X1,X3)))) ),
inference(superposition,[status(thm)],[c_160,c_162]) ).
cnf(c_1047,plain,
( ~ is_a_theorem(implies(X0,implies(implies(X1,X2),implies(X3,X1))))
| is_a_theorem(implies(X0,implies(implies(X1,X2),implies(X3,X2)))) ),
inference(superposition,[status(thm)],[c_50,c_293]) ).
cnf(c_16158,plain,
is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
inference(superposition,[status(thm)],[c_50,c_1047]) ).
cnf(c_16243,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_53,c_16158]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL025-1 : TPTP v8.1.2. Released v1.0.0.
% 0.04/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu May 2 19:14:51 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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
% 10.02/2.20 % SZS status Started for theBenchmark.p
% 10.02/2.20 % SZS status Unsatisfiable for theBenchmark.p
% 10.02/2.20
% 10.02/2.20 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 10.02/2.20
% 10.02/2.20 ------ iProver source info
% 10.02/2.20
% 10.02/2.20 git: date: 2024-05-02 19:28:25 +0000
% 10.02/2.20 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 10.02/2.20 git: non_committed_changes: false
% 10.02/2.20
% 10.02/2.20 ------ Parsing...successful
% 10.02/2.20
% 10.02/2.20
% 10.02/2.20
% 10.02/2.20 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 10.02/2.20
% 10.02/2.20 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 10.02/2.20 ------ Proving...
% 10.02/2.20 ------ Problem Properties
% 10.02/2.20
% 10.02/2.20
% 10.02/2.20 clauses 5
% 10.02/2.20 conjectures 1
% 10.02/2.20 EPR 0
% 10.02/2.20 Horn 5
% 10.02/2.20 unary 4
% 10.02/2.20 binary 0
% 10.02/2.20 lits 7
% 10.02/2.20 lits eq 0
% 10.02/2.20 fd_pure 0
% 10.02/2.20 fd_pseudo 0
% 10.02/2.20 fd_cond 0
% 10.02/2.20 fd_pseudo_cond 0
% 10.02/2.20 AC symbols 0
% 10.02/2.20
% 10.02/2.20 ------ Input Options Time Limit: Unbounded
% 10.02/2.20
% 10.02/2.20
% 10.02/2.20 ------
% 10.02/2.20 Current options:
% 10.02/2.20 ------
% 10.02/2.20
% 10.02/2.20
% 10.02/2.20
% 10.02/2.20
% 10.02/2.20 ------ Proving...
% 10.02/2.20
% 10.02/2.20
% 10.02/2.20 % SZS status Unsatisfiable for theBenchmark.p
% 10.02/2.20
% 10.02/2.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.02/2.20
% 10.02/2.20
%------------------------------------------------------------------------------