TSTP Solution File: LCL018-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL018-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n008.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:36 EDT 2024
% Result : Unsatisfiable 56.62s 8.74s
% Output : CNFRefutation 56.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 3
% Syntax : Number of clauses : 31 ( 13 unt; 0 nHn; 14 RR)
% Number of literals : 60 ( 0 equ; 30 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 6 ( 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 : 83 ( 1 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(equivalent(X0,equivalent(X1,X2)),X1),equivalent(X2,X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pym) ).
cnf(c_51,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(b,c)),c),equivalent(b,a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_pyo) ).
cnf(c_158,plain,
( ~ is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),X1))
| is_a_theorem(equivalent(X2,X0)) ),
inference(resolution,[status(thm)],[c_49,c_50]) ).
cnf(c_176,plain,
is_a_theorem(equivalent(X0,equivalent(X1,equivalent(equivalent(equivalent(X2,X1),X0),X2)))),
inference(resolution,[status(thm)],[c_158,c_50]) ).
cnf(c_180,plain,
( ~ is_a_theorem(X0)
| is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X2,X1),X0),X2))) ),
inference(resolution,[status(thm)],[c_176,c_49]) ).
cnf(c_186,plain,
( ~ is_a_theorem(X0)
| ~ is_a_theorem(X1)
| is_a_theorem(equivalent(equivalent(equivalent(X2,X1),X0),X2)) ),
inference(resolution,[status(thm)],[c_180,c_49]) ).
cnf(c_196,plain,
( ~ is_a_theorem(equivalent(equivalent(X0,X1),X2))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X2)
| is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c_186,c_49]) ).
cnf(c_237,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(X1,X0),equivalent(X2,X3)),X1)))
| ~ is_a_theorem(X3)
| is_a_theorem(X2) ),
inference(resolution,[status(thm)],[c_196,c_176]) ).
cnf(c_239,plain,
( ~ is_a_theorem(X0)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X2)
| is_a_theorem(equivalent(X1,X2)) ),
inference(resolution,[status(thm)],[c_196,c_186]) ).
cnf(c_261,plain,
( ~ is_a_theorem(X0)
| ~ is_a_theorem(X1)
| is_a_theorem(equivalent(X0,X1)) ),
inference(resolution,[status(thm)],[c_239,c_50]) ).
cnf(c_275,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| ~ is_a_theorem(X1)
| is_a_theorem(equivalent(X2,X0)) ),
inference(resolution,[status(thm)],[c_261,c_158]) ).
cnf(c_364,plain,
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X1)
| is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c_237,c_180]) ).
cnf(c_417,plain,
( ~ is_a_theorem(equivalent(X0,X1))
| is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X0)),X2)) ),
inference(resolution,[status(thm)],[c_364,c_50]) ).
cnf(c_482,plain,
( ~ is_a_theorem(X0)
| is_a_theorem(equivalent(X1,equivalent(equivalent(X1,equivalent(X2,X0)),X2))) ),
inference(resolution,[status(thm)],[c_275,c_50]) ).
cnf(c_484,plain,
( ~ is_a_theorem(X0)
| is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X0),X2),X1),X2)) ),
inference(resolution,[status(thm)],[c_275,c_176]) ).
cnf(c_519,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| ~ is_a_theorem(X2)
| is_a_theorem(equivalent(X1,X0)) ),
inference(resolution,[status(thm)],[c_482,c_275]) ).
cnf(c_970,plain,
( ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),X0))
| is_a_theorem(equivalent(X1,X2)) ),
inference(resolution,[status(thm)],[c_519,c_176]) ).
cnf(c_1108,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| is_a_theorem(equivalent(X2,equivalent(X1,X0))) ),
inference(resolution,[status(thm)],[c_970,c_417]) ).
cnf(c_1113,plain,
( ~ is_a_theorem(X0)
| is_a_theorem(equivalent(equivalent(X1,X0),X1)) ),
inference(resolution,[status(thm)],[c_970,c_484]) ).
cnf(c_1168,plain,
( ~ is_a_theorem(equivalent(X0,X1))
| is_a_theorem(equivalent(X1,X0)) ),
inference(resolution,[status(thm)],[c_1113,c_158]) ).
cnf(c_1214,plain,
is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(equivalent(X1,X0),X2),X1)),X2)),
inference(resolution,[status(thm)],[c_1168,c_176]) ).
cnf(c_3273,plain,
is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(X1,equivalent(X2,X0)),X2),X1))),
inference(resolution,[status(thm)],[c_1214,c_970]) ).
cnf(c_4043,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,equivalent(X1,X2)),X1),X0),X2)),
inference(resolution,[status(thm)],[c_3273,c_1168]) ).
cnf(c_4143,plain,
is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(X1,X0),equivalent(X2,X1)),X2))),
inference(resolution,[status(thm)],[c_4043,c_158]) ).
cnf(c_7045,plain,
is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(X1,X2),equivalent(X0,X1)),X2))),
inference(resolution,[status(thm)],[c_1108,c_4143]) ).
cnf(c_8280,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X2,X0)),X1),X2)),
inference(resolution,[status(thm)],[c_7045,c_1168]) ).
cnf(c_11005,plain,
is_a_theorem(equivalent(X0,equivalent(equivalent(X1,equivalent(X2,X0)),equivalent(X2,X1)))),
inference(resolution,[status(thm)],[c_8280,c_158]) ).
cnf(c_15953,plain,
is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X1,equivalent(X0,X2)),X2))),
inference(resolution,[status(thm)],[c_11005,c_1108]) ).
cnf(c_21615,plain,
is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(X1,X2)),X2),equivalent(X1,X0))),
inference(resolution,[status(thm)],[c_15953,c_1168]) ).
cnf(c_25621,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_51,c_21615]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL018-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n008.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 18:57:58 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/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
% 56.62/8.74 % SZS status Started for theBenchmark.p
% 56.62/8.74 % SZS status Unsatisfiable for theBenchmark.p
% 56.62/8.74
% 56.62/8.74 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 56.62/8.74
% 56.62/8.74 ------ iProver source info
% 56.62/8.74
% 56.62/8.74 git: date: 2024-05-02 19:28:25 +0000
% 56.62/8.74 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 56.62/8.74 git: non_committed_changes: false
% 56.62/8.74
% 56.62/8.74 ------ Parsing...successful
% 56.62/8.74
% 56.62/8.74
% 56.62/8.74
% 56.62/8.74 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 56.62/8.74
% 56.62/8.74 ------ Preprocessing...
% 56.62/8.74 ------ Proving...
% 56.62/8.74 ------ Problem Properties
% 56.62/8.74
% 56.62/8.74
% 56.62/8.74 clauses 3
% 56.62/8.74 conjectures 1
% 56.62/8.74 EPR 0
% 56.62/8.74 Horn 3
% 56.62/8.74 unary 2
% 56.62/8.74 binary 0
% 56.62/8.74 lits 5
% 56.62/8.74 lits eq 0
% 56.62/8.74 fd_pure 0
% 56.62/8.74 fd_pseudo 0
% 56.62/8.74 fd_cond 0
% 56.62/8.74 fd_pseudo_cond 0
% 56.62/8.74 AC symbols 0
% 56.62/8.74
% 56.62/8.74 ------ Input Options Time Limit: Unbounded
% 56.62/8.74
% 56.62/8.74
% 56.62/8.74 ------
% 56.62/8.74 Current options:
% 56.62/8.74 ------
% 56.62/8.74
% 56.62/8.74
% 56.62/8.74
% 56.62/8.74
% 56.62/8.74 ------ Proving...
% 56.62/8.74
% 56.62/8.74
% 56.62/8.74 % SZS status Unsatisfiable for theBenchmark.p
% 56.62/8.74
% 56.62/8.74 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 56.62/8.74
% 56.62/8.74
%------------------------------------------------------------------------------