TSTP Solution File: LCL017-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL017-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n027.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 68.80s 10.18s
% Output : CNFRefutation 68.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 3
% Syntax : Number of clauses : 45 ( 19 unt; 0 nHn; 22 RR)
% Number of literals : 87 ( 0 equ; 43 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 : 119 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(c_50,plain,
is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(X1,X2)),X2),equivalent(X1,X0))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pyo) ).
cnf(c_51,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(c,equivalent(equivalent(c,b),a)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_yro) ).
cnf(c_69,plain,
( ~ is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),X2))
| is_a_theorem(equivalent(X1,X0)) ),
inference(superposition,[status(thm)],[c_50,c_49]) ).
cnf(c_73,plain,
is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X2,equivalent(X0,equivalent(X2,X1)))))),
inference(superposition,[status(thm)],[c_50,c_69]) ).
cnf(c_83,plain,
( ~ is_a_theorem(X0)
| is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X0,equivalent(X2,X1))))) ),
inference(superposition,[status(thm)],[c_73,c_49]) ).
cnf(c_87,plain,
( ~ is_a_theorem(X0)
| ~ is_a_theorem(X1)
| is_a_theorem(equivalent(X2,equivalent(X0,equivalent(X2,X1)))) ),
inference(superposition,[status(thm)],[c_83,c_49]) ).
cnf(c_122,plain,
( ~ is_a_theorem(X0)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X2)
| is_a_theorem(equivalent(X0,equivalent(X2,X1))) ),
inference(superposition,[status(thm)],[c_87,c_49]) ).
cnf(c_130,plain,
( ~ is_a_theorem(X0)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X2)
| is_a_theorem(equivalent(X2,X1)) ),
inference(superposition,[status(thm)],[c_122,c_49]) ).
cnf(c_161,plain,
( ~ is_a_theorem(X0)
| ~ is_a_theorem(X1)
| is_a_theorem(equivalent(X1,X0)) ),
inference(superposition,[status(thm)],[c_50,c_130]) ).
cnf(c_211,plain,
( ~ is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),X2))
| is_a_theorem(equivalent(X1,X0)) ),
inference(superposition,[status(thm)],[c_50,c_49]) ).
cnf(c_214,plain,
is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X2,equivalent(X0,equivalent(X2,X1)))))),
inference(superposition,[status(thm)],[c_50,c_211]) ).
cnf(c_215,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| ~ is_a_theorem(X2)
| is_a_theorem(equivalent(X1,X0)) ),
inference(superposition,[status(thm)],[c_161,c_211]) ).
cnf(c_290,plain,
( ~ is_a_theorem(X0)
| is_a_theorem(equivalent(X1,equivalent(equivalent(X0,equivalent(X1,X2)),X2))) ),
inference(superposition,[status(thm)],[c_50,c_215]) ).
cnf(c_292,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X0,X2))))
| is_a_theorem(equivalent(X2,X1)) ),
inference(superposition,[status(thm)],[c_214,c_215]) ).
cnf(c_2264,plain,
( ~ is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),X2))
| is_a_theorem(equivalent(X1,X0)) ),
inference(superposition,[status(thm)],[c_50,c_49]) ).
cnf(c_2270,plain,
is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X2,equivalent(X0,equivalent(X2,X1)))))),
inference(superposition,[status(thm)],[c_50,c_2264]) ).
cnf(c_2310,plain,
is_a_theorem(equivalent(equivalent(X0,equivalent(X0,X1)),X1)),
inference(superposition,[status(thm)],[c_2270,c_292]) ).
cnf(c_2314,plain,
is_a_theorem(equivalent(X0,X0)),
inference(superposition,[status(thm)],[c_2310,c_2264]) ).
cnf(c_45073,plain,
( ~ is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),X2))
| is_a_theorem(equivalent(X1,X0)) ),
inference(superposition,[status(thm)],[c_50,c_49]) ).
cnf(c_45081,plain,
is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X2,equivalent(X0,equivalent(X2,X1)))))),
inference(superposition,[status(thm)],[c_50,c_45073]) ).
cnf(c_45082,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| ~ is_a_theorem(X2)
| is_a_theorem(equivalent(X1,X0)) ),
inference(superposition,[status(thm)],[c_161,c_45073]) ).
cnf(c_45088,plain,
( ~ is_a_theorem(X0)
| ~ is_a_theorem(X1)
| is_a_theorem(equivalent(equivalent(X0,equivalent(X2,X1)),X2)) ),
inference(superposition,[status(thm)],[c_290,c_45082]) ).
cnf(c_45089,plain,
( ~ is_a_theorem(X0)
| is_a_theorem(equivalent(X1,equivalent(X1,X0))) ),
inference(superposition,[status(thm)],[c_2314,c_45082]) ).
cnf(c_45093,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(X2)
| is_a_theorem(X1) ),
inference(superposition,[status(thm)],[c_45088,c_49]) ).
cnf(c_45103,plain,
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X1)
| is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_2314,c_45093]) ).
cnf(c_45115,plain,
( ~ is_a_theorem(equivalent(X0,X1))
| is_a_theorem(equivalent(equivalent(X1,equivalent(X0,X2)),X2)) ),
inference(superposition,[status(thm)],[c_50,c_45103]) ).
cnf(c_45130,plain,
is_a_theorem(equivalent(equivalent(X0,equivalent(X0,X1)),X1)),
inference(superposition,[status(thm)],[c_45081,c_292]) ).
cnf(c_45132,plain,
( ~ is_a_theorem(equivalent(X0,X1))
| is_a_theorem(equivalent(X1,X0)) ),
inference(superposition,[status(thm)],[c_45089,c_292]) ).
cnf(c_45140,plain,
is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X1,equivalent(X0,X2)),X2))),
inference(superposition,[status(thm)],[c_50,c_45132]) ).
cnf(c_45144,plain,
is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X1,X0)))),
inference(superposition,[status(thm)],[c_45130,c_45132]) ).
cnf(c_45163,plain,
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X2)
| is_a_theorem(equivalent(X1,equivalent(X0,X2))) ),
inference(superposition,[status(thm)],[c_45140,c_45093]) ).
cnf(c_45165,plain,
is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X2,equivalent(equivalent(X2,X1),X0))))),
inference(superposition,[status(thm)],[c_45140,c_292]) ).
cnf(c_45170,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| ~ is_a_theorem(equivalent(X1,X0))
| is_a_theorem(X2) ),
inference(superposition,[status(thm)],[c_45115,c_49]) ).
cnf(c_45211,plain,
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(equivalent(X1,X2))
| is_a_theorem(equivalent(X2,X0)) ),
inference(superposition,[status(thm)],[c_45163,c_292]) ).
cnf(c_45347,plain,
( ~ is_a_theorem(equivalent(equivalent(X0,equivalent(X0,X1)),X2))
| is_a_theorem(equivalent(X2,X1)) ),
inference(superposition,[status(thm)],[c_45144,c_45211]) ).
cnf(c_45367,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X2),X1)),
inference(superposition,[status(thm)],[c_45140,c_45347]) ).
cnf(c_45729,plain,
is_a_theorem(equivalent(equivalent(X0,equivalent(X1,equivalent(equivalent(X1,X0),X2))),X2)),
inference(superposition,[status(thm)],[c_45165,c_45132]) ).
cnf(c_45987,plain,
is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X1,equivalent(X0,X2))))),
inference(superposition,[status(thm)],[c_45367,c_45073]) ).
cnf(c_46517,plain,
( ~ is_a_theorem(equivalent(equivalent(X0,X1),X2))
| is_a_theorem(equivalent(X0,equivalent(X2,X1))) ),
inference(superposition,[status(thm)],[c_45987,c_45170]) ).
cnf(c_48816,plain,
is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(equivalent(X1,X0),X2))),
inference(superposition,[status(thm)],[c_50,c_46517]) ).
cnf(c_48853,plain,
is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X2,equivalent(equivalent(X2,X0),X1))))),
inference(superposition,[status(thm)],[c_45729,c_46517]) ).
cnf(c_49174,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| is_a_theorem(equivalent(equivalent(X1,X0),X2)) ),
inference(superposition,[status(thm)],[c_48816,c_49]) ).
cnf(c_52417,plain,
is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X2,equivalent(equivalent(X2,X1),X0)))),
inference(superposition,[status(thm)],[c_48853,c_49174]) ).
cnf(c_52441,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_51,c_52417]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : LCL017-1 : TPTP v8.1.2. Released v1.0.0.
% 0.02/0.11 % Command : run_iprover %s %d THM
% 0.10/0.31 % Computer : n027.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Thu May 2 19:22:35 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 68.80/10.18 % SZS status Started for theBenchmark.p
% 68.80/10.18 % SZS status Unsatisfiable for theBenchmark.p
% 68.80/10.18
% 68.80/10.18 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 68.80/10.18
% 68.80/10.18 ------ iProver source info
% 68.80/10.18
% 68.80/10.18 git: date: 2024-05-02 19:28:25 +0000
% 68.80/10.18 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 68.80/10.18 git: non_committed_changes: false
% 68.80/10.18
% 68.80/10.18 ------ Parsing...successful
% 68.80/10.18
% 68.80/10.18
% 68.80/10.18
% 68.80/10.18 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 68.80/10.18
% 68.80/10.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 68.80/10.18 ------ Proving...
% 68.80/10.18 ------ Problem Properties
% 68.80/10.18
% 68.80/10.18
% 68.80/10.18 clauses 3
% 68.80/10.18 conjectures 1
% 68.80/10.18 EPR 0
% 68.80/10.18 Horn 3
% 68.80/10.18 unary 2
% 68.80/10.18 binary 0
% 68.80/10.18 lits 5
% 68.80/10.18 lits eq 0
% 68.80/10.18 fd_pure 0
% 68.80/10.18 fd_pseudo 0
% 68.80/10.18 fd_cond 0
% 68.80/10.18 fd_pseudo_cond 0
% 68.80/10.18 AC symbols 0
% 68.80/10.18
% 68.80/10.18 ------ Input Options Time Limit: Unbounded
% 68.80/10.18
% 68.80/10.18
% 68.80/10.18 ------
% 68.80/10.18 Current options:
% 68.80/10.18 ------
% 68.80/10.18
% 68.80/10.18
% 68.80/10.18
% 68.80/10.18
% 68.80/10.18 ------ Proving...
% 68.80/10.18
% 68.80/10.18
% 68.80/10.18 % SZS status Unsatisfiable for theBenchmark.p
% 68.80/10.18
% 68.80/10.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 68.80/10.18
% 68.80/10.19
%------------------------------------------------------------------------------