TSTP Solution File: LCL257-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL257-1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n025.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:29 EDT 2024
% Result : Unsatisfiable 3.95s 1.12s
% Output : CNFRefutation 3.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 3
% Syntax : Number of clauses : 23 ( 11 unt; 0 nHn; 11 RR)
% Number of literals : 39 ( 0 equ; 18 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 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 : 56 ( 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,X1),equivalent(equivalent(X2,X1),equivalent(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',yql) ).
cnf(c_51,negated_conjecture,
~ is_a_theorem(equivalent(x,equivalent(equivalent(y,z),equivalent(equivalent(z,x),y)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_xhn) ).
cnf(c_93,plain,
( ~ is_a_theorem(equivalent(X0,X1))
| is_a_theorem(equivalent(equivalent(X2,X1),equivalent(X0,X2))) ),
inference(superposition,[status(thm)],[c_50,c_49]) ).
cnf(c_95,plain,
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(equivalent(X2,X1))
| is_a_theorem(equivalent(X0,X2)) ),
inference(superposition,[status(thm)],[c_93,c_49]) ).
cnf(c_107,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X3,X1))))
| is_a_theorem(equivalent(equivalent(X3,X2),X0)) ),
inference(superposition,[status(thm)],[c_50,c_95]) ).
cnf(c_143,plain,
( ~ is_a_theorem(equivalent(X0,X1))
| is_a_theorem(equivalent(equivalent(X2,X1),equivalent(X0,X2))) ),
inference(superposition,[status(thm)],[c_50,c_49]) ).
cnf(c_144,plain,
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(equivalent(X2,X1))
| is_a_theorem(equivalent(X0,X2)) ),
inference(superposition,[status(thm)],[c_143,c_49]) ).
cnf(c_147,plain,
is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X1))),
inference(superposition,[status(thm)],[c_50,c_107]) ).
cnf(c_158,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| is_a_theorem(equivalent(equivalent(X1,X2),X0)) ),
inference(superposition,[status(thm)],[c_147,c_144]) ).
cnf(c_178,plain,
is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X2,X0)),equivalent(X2,X1))),
inference(superposition,[status(thm)],[c_50,c_158]) ).
cnf(c_179,plain,
( ~ is_a_theorem(equivalent(X0,X1))
| is_a_theorem(equivalent(equivalent(X0,X2),equivalent(X2,X1))) ),
inference(superposition,[status(thm)],[c_143,c_158]) ).
cnf(c_211,plain,
( ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X2,X0)))
| is_a_theorem(equivalent(X2,X1)) ),
inference(superposition,[status(thm)],[c_178,c_49]) ).
cnf(c_267,plain,
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(equivalent(X0,X2))
| is_a_theorem(equivalent(X2,X1)) ),
inference(superposition,[status(thm)],[c_179,c_49]) ).
cnf(c_273,plain,
( ~ is_a_theorem(equivalent(equivalent(X0,X1),X2))
| is_a_theorem(equivalent(X2,equivalent(equivalent(X3,X1),equivalent(X0,X3)))) ),
inference(superposition,[status(thm)],[c_50,c_267]) ).
cnf(c_380,plain,
~ is_a_theorem(equivalent(equivalent(equivalent(z,x),z),x)),
inference(superposition,[status(thm)],[c_273,c_51]) ).
cnf(c_382,plain,
( ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X0,X2),X3)))
| is_a_theorem(equivalent(equivalent(X2,X1),X3)) ),
inference(superposition,[status(thm)],[c_273,c_211]) ).
cnf(c_571,plain,
is_a_theorem(equivalent(equivalent(X0,X0),equivalent(X1,X1))),
inference(superposition,[status(thm)],[c_50,c_382]) ).
cnf(c_642,plain,
is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X1,X0))),
inference(superposition,[status(thm)],[c_571,c_382]) ).
cnf(c_665,plain,
is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X0)),X1)),
inference(superposition,[status(thm)],[c_642,c_382]) ).
cnf(c_746,plain,
is_a_theorem(equivalent(X0,equivalent(equivalent(X0,X1),X1))),
inference(superposition,[status(thm)],[c_665,c_211]) ).
cnf(c_1035,plain,
is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X0),X1)),
inference(superposition,[status(thm)],[c_746,c_211]) ).
cnf(c_1412,plain,
$false,
inference(superposition,[status(thm)],[c_1035,c_380]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : LCL257-1 : TPTP v8.1.2. Released v2.0.0.
% 0.02/0.12 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n025.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 19:10:43 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.18/0.44 Running first-order theorem proving
% 0.18/0.44 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
% 3.95/1.12 % SZS status Started for theBenchmark.p
% 3.95/1.12 % SZS status Unsatisfiable for theBenchmark.p
% 3.95/1.12
% 3.95/1.12 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.95/1.12
% 3.95/1.12 ------ iProver source info
% 3.95/1.12
% 3.95/1.12 git: date: 2024-05-02 19:28:25 +0000
% 3.95/1.12 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.95/1.12 git: non_committed_changes: false
% 3.95/1.12
% 3.95/1.12 ------ Parsing...successful
% 3.95/1.12
% 3.95/1.12
% 3.95/1.12
% 3.95/1.12 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 3.95/1.12
% 3.95/1.12 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.95/1.12 ------ Proving...
% 3.95/1.12 ------ Problem Properties
% 3.95/1.12
% 3.95/1.12
% 3.95/1.12 clauses 3
% 3.95/1.12 conjectures 1
% 3.95/1.12 EPR 0
% 3.95/1.12 Horn 3
% 3.95/1.12 unary 2
% 3.95/1.12 binary 0
% 3.95/1.12 lits 5
% 3.95/1.12 lits eq 0
% 3.95/1.12 fd_pure 0
% 3.95/1.12 fd_pseudo 0
% 3.95/1.12 fd_cond 0
% 3.95/1.12 fd_pseudo_cond 0
% 3.95/1.12 AC symbols 0
% 3.95/1.12
% 3.95/1.12 ------ Input Options Time Limit: Unbounded
% 3.95/1.12
% 3.95/1.12
% 3.95/1.12 ------
% 3.95/1.12 Current options:
% 3.95/1.12 ------
% 3.95/1.12
% 3.95/1.12
% 3.95/1.12
% 3.95/1.12
% 3.95/1.12 ------ Proving...
% 3.95/1.12
% 3.95/1.12
% 3.95/1.12 % SZS status Unsatisfiable for theBenchmark.p
% 3.95/1.12
% 3.95/1.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.95/1.12
% 3.95/1.12
%------------------------------------------------------------------------------