TSTP Solution File: LCL009-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL009-1 : TPTP v8.1.2. Released v1.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:36:34 EDT 2024
% Result : Unsatisfiable 3.50s 1.17s
% Output : CNFRefutation 3.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of clauses : 23 ( 10 unt; 0 nHn; 11 RR)
% Number of literals : 40 ( 0 equ; 19 neg)
% Maximal clause size : 3 ( 1 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 : 58 ( 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(equivalent(equivalent(a,b),c),equivalent(a,equivalent(b,c)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ec_5) ).
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_138,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_139,plain,
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(equivalent(X2,X1))
| is_a_theorem(equivalent(X0,X2)) ),
inference(superposition,[status(thm)],[c_138,c_49]) ).
cnf(c_142,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_142,c_139]) ).
cnf(c_181,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_182,plain,
( ~ is_a_theorem(equivalent(X0,X1))
| is_a_theorem(equivalent(equivalent(X0,X2),equivalent(X2,X1))) ),
inference(superposition,[status(thm)],[c_138,c_158]) ).
cnf(c_208,plain,
( ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X2,X0)))
| is_a_theorem(equivalent(X2,X1)) ),
inference(superposition,[status(thm)],[c_181,c_49]) ).
cnf(c_260,plain,
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(equivalent(X0,X2))
| is_a_theorem(equivalent(X2,X1)) ),
inference(superposition,[status(thm)],[c_182,c_49]) ).
cnf(c_266,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_260]) ).
cnf(c_288,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| is_a_theorem(equivalent(equivalent(X1,X3),equivalent(X0,equivalent(X2,X3)))) ),
inference(superposition,[status(thm)],[c_182,c_107]) ).
cnf(c_376,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_266,c_208]) ).
cnf(c_506,plain,
~ is_a_theorem(equivalent(a,equivalent(equivalent(a,b),b))),
inference(superposition,[status(thm)],[c_288,c_51]) ).
cnf(c_564,plain,
is_a_theorem(equivalent(equivalent(X0,X0),equivalent(X1,X1))),
inference(superposition,[status(thm)],[c_50,c_376]) ).
cnf(c_646,plain,
is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X1,X0))),
inference(superposition,[status(thm)],[c_564,c_376]) ).
cnf(c_714,plain,
is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X0)),X1)),
inference(superposition,[status(thm)],[c_646,c_376]) ).
cnf(c_743,plain,
is_a_theorem(equivalent(X0,equivalent(equivalent(X0,X1),X1))),
inference(superposition,[status(thm)],[c_714,c_208]) ).
cnf(c_838,plain,
$false,
inference(superposition,[status(thm)],[c_743,c_506]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : LCL009-1 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.13 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n025.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 19:29:28 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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.50/1.17 % SZS status Started for theBenchmark.p
% 3.50/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 3.50/1.17
% 3.50/1.17 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.50/1.17
% 3.50/1.17 ------ iProver source info
% 3.50/1.17
% 3.50/1.17 git: date: 2024-05-02 19:28:25 +0000
% 3.50/1.17 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.50/1.17 git: non_committed_changes: false
% 3.50/1.17
% 3.50/1.17 ------ Parsing...successful
% 3.50/1.17
% 3.50/1.17
% 3.50/1.17
% 3.50/1.17 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 3.50/1.17
% 3.50/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.50/1.17 ------ Proving...
% 3.50/1.17 ------ Problem Properties
% 3.50/1.17
% 3.50/1.17
% 3.50/1.17 clauses 3
% 3.50/1.17 conjectures 1
% 3.50/1.17 EPR 0
% 3.50/1.17 Horn 3
% 3.50/1.17 unary 2
% 3.50/1.17 binary 0
% 3.50/1.17 lits 5
% 3.50/1.17 lits eq 0
% 3.50/1.17 fd_pure 0
% 3.50/1.17 fd_pseudo 0
% 3.50/1.17 fd_cond 0
% 3.50/1.17 fd_pseudo_cond 0
% 3.50/1.17 AC symbols 0
% 3.50/1.17
% 3.50/1.17 ------ Input Options Time Limit: Unbounded
% 3.50/1.17
% 3.50/1.17
% 3.50/1.17 ------
% 3.50/1.17 Current options:
% 3.50/1.17 ------
% 3.50/1.17
% 3.50/1.17
% 3.50/1.17
% 3.50/1.17
% 3.50/1.17 ------ Proving...
% 3.50/1.17
% 3.50/1.17
% 3.50/1.17 % SZS status Unsatisfiable for theBenchmark.p
% 3.50/1.17
% 3.50/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.50/1.17
% 3.50/1.17
%------------------------------------------------------------------------------