TSTP Solution File: LCL129-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL129-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n005.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:57 EDT 2024
% Result : Unsatisfiable 200.18s 25.80s
% Output : CNFRefutation 200.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of clauses : 22 ( 9 unt; 0 nHn; 12 RR)
% Number of literals : 39 ( 0 equ; 18 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 75 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
( ~ is_a_theorem(equivalent(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(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(equivalent(X0,equivalent(X3,X2)),equivalent(X1,X3)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s_4) ).
cnf(c_51,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_lg_2) ).
cnf(c_80,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| is_a_theorem(equivalent(equivalent(X0,equivalent(X3,X2)),equivalent(X1,X3))) ),
inference(superposition,[status(thm)],[c_50,c_49]) ).
cnf(c_83,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| ~ is_a_theorem(equivalent(X0,equivalent(X3,X2)))
| is_a_theorem(equivalent(X1,X3)) ),
inference(superposition,[status(thm)],[c_80,c_49]) ).
cnf(c_87,plain,
( ~ is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X3,equivalent(X1,X4))))
| is_a_theorem(equivalent(equivalent(X0,equivalent(X4,X2)),X3)) ),
inference(superposition,[status(thm)],[c_50,c_83]) ).
cnf(c_94,plain,
is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X0,equivalent(X1,X2)))),
inference(superposition,[status(thm)],[c_50,c_87]) ).
cnf(c_97,plain,
( ~ is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X3,equivalent(X1,X2))))
| is_a_theorem(equivalent(X0,X3)) ),
inference(superposition,[status(thm)],[c_94,c_83]) ).
cnf(c_104,plain,
is_a_theorem(equivalent(X0,X0)),
inference(superposition,[status(thm)],[c_94,c_97]) ).
cnf(c_1610,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| is_a_theorem(equivalent(equivalent(X0,equivalent(X3,X2)),equivalent(X1,X3))) ),
inference(superposition,[status(thm)],[c_50,c_49]) ).
cnf(c_1614,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| ~ is_a_theorem(equivalent(X0,equivalent(X3,X2)))
| is_a_theorem(equivalent(X1,X3)) ),
inference(superposition,[status(thm)],[c_1610,c_49]) ).
cnf(c_1618,plain,
( ~ is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X3,equivalent(X1,X4))))
| is_a_theorem(equivalent(equivalent(X0,equivalent(X4,X2)),X3)) ),
inference(superposition,[status(thm)],[c_50,c_1614]) ).
cnf(c_1619,plain,
( ~ is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X3,X1)))
| ~ is_a_theorem(equivalent(X0,equivalent(X4,X2)))
| is_a_theorem(equivalent(X4,X3)) ),
inference(superposition,[status(thm)],[c_1610,c_1614]) ).
cnf(c_1620,plain,
( ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X2,X1)))
| is_a_theorem(equivalent(X0,X2)) ),
inference(superposition,[status(thm)],[c_104,c_1614]) ).
cnf(c_1629,plain,
is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X1)),X0)),
inference(superposition,[status(thm)],[c_104,c_1618]) ).
cnf(c_1631,plain,
( ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X2,X2)),equivalent(X3,X1)))
| is_a_theorem(equivalent(X0,X3)) ),
inference(superposition,[status(thm)],[c_1629,c_1614]) ).
cnf(c_1637,plain,
is_a_theorem(equivalent(X0,equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X2,X1)))),
inference(superposition,[status(thm)],[c_50,c_1631]) ).
cnf(c_1700,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| is_a_theorem(equivalent(X1,equivalent(equivalent(X0,equivalent(equivalent(X3,X4),X2)),equivalent(X4,X3)))) ),
inference(superposition,[status(thm)],[c_1637,c_1619]) ).
cnf(c_2278,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,equivalent(X2,X3)),X4)))
| is_a_theorem(equivalent(X1,equivalent(X0,equivalent(equivalent(X3,X2),X4)))) ),
inference(superposition,[status(thm)],[c_1700,c_1620]) ).
cnf(c_2321,plain,
is_a_theorem(equivalent(X0,equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(equivalent(X2,X3),equivalent(X1,X3))))),
inference(superposition,[status(thm)],[c_50,c_2278]) ).
cnf(c_2812,plain,
is_a_theorem(equivalent(X0,equivalent(X0,equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),equivalent(X2,X3)))))),
inference(superposition,[status(thm)],[c_2321,c_2278]) ).
cnf(c_2843,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_51,c_2812]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.13 % Problem : LCL129-1 : TPTP v8.1.2. Released v1.0.0.
% 0.09/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n005.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 18:51:26 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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
% 200.18/25.80 % SZS status Started for theBenchmark.p
% 200.18/25.80 % SZS status Unsatisfiable for theBenchmark.p
% 200.18/25.80
% 200.18/25.80 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 200.18/25.80
% 200.18/25.80 ------ iProver source info
% 200.18/25.80
% 200.18/25.80 git: date: 2024-05-02 19:28:25 +0000
% 200.18/25.80 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 200.18/25.80 git: non_committed_changes: false
% 200.18/25.80
% 200.18/25.80 ------ Parsing...successful
% 200.18/25.80
% 200.18/25.80
% 200.18/25.80
% 200.18/25.80 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 200.18/25.80
% 200.18/25.80 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 200.18/25.80 ------ Proving...
% 200.18/25.80 ------ Problem Properties
% 200.18/25.80
% 200.18/25.80
% 200.18/25.80 clauses 3
% 200.18/25.80 conjectures 1
% 200.18/25.80 EPR 0
% 200.18/25.80 Horn 3
% 200.18/25.80 unary 2
% 200.18/25.80 binary 0
% 200.18/25.80 lits 5
% 200.18/25.80 lits eq 0
% 200.18/25.80 fd_pure 0
% 200.18/25.80 fd_pseudo 0
% 200.18/25.80 fd_cond 0
% 200.18/25.80 fd_pseudo_cond 0
% 200.18/25.80 AC symbols 0
% 200.18/25.80
% 200.18/25.80 ------ Input Options Time Limit: Unbounded
% 200.18/25.80
% 200.18/25.80
% 200.18/25.80 ------
% 200.18/25.80 Current options:
% 200.18/25.80 ------
% 200.18/25.80
% 200.18/25.80
% 200.18/25.80
% 200.18/25.80
% 200.18/25.80 ------ Proving...
% 200.18/25.80
% 200.18/25.80
% 200.18/25.80 % SZS status Unsatisfiable for theBenchmark.p
% 200.18/25.80
% 200.18/25.80 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 200.18/25.80
% 200.18/25.80
%------------------------------------------------------------------------------