TSTP Solution File: LCL014-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL014-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n020.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:35 EDT 2024
% Result : Unsatisfiable 61.63s 9.22s
% Output : CNFRefutation 61.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 3
% Syntax : Number of clauses : 30 ( 12 unt; 0 nHn; 17 RR)
% Number of literals : 55 ( 0 equ; 26 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 : 82 ( 0 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(X0,equivalent(X1,X2)),equivalent(X2,equivalent(X0,X1)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wn) ).
cnf(c_51,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(equivalent(b,equivalent(a,c)),equivalent(c,b)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_xgf) ).
cnf(c_1058,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| is_a_theorem(equivalent(X2,equivalent(X0,X1))) ),
inference(superposition,[status(thm)],[c_50,c_49]) ).
cnf(c_1061,plain,
is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X0,equivalent(X1,X2)),X2))),
inference(superposition,[status(thm)],[c_50,c_1058]) ).
cnf(c_1062,plain,
( ~ is_a_theorem(equivalent(X0,X1))
| is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),X2)) ),
inference(superposition,[status(thm)],[c_1061,c_49]) ).
cnf(c_1063,plain,
is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X1,equivalent(X2,X0))))),
inference(superposition,[status(thm)],[c_1061,c_1058]) ).
cnf(c_1066,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| ~ is_a_theorem(equivalent(X0,X1))
| is_a_theorem(X2) ),
inference(superposition,[status(thm)],[c_1062,c_49]) ).
cnf(c_1077,plain,
( ~ is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),X2))
| is_a_theorem(equivalent(X0,X1)) ),
inference(superposition,[status(thm)],[c_50,c_1066]) ).
cnf(c_1078,plain,
( ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,equivalent(X1,X2))))
| is_a_theorem(X2) ),
inference(superposition,[status(thm)],[c_1061,c_1066]) ).
cnf(c_1079,plain,
( ~ is_a_theorem(equivalent(equivalent(X0,equivalent(X1,equivalent(X2,X3))),X2))
| ~ is_a_theorem(equivalent(X0,X1))
| is_a_theorem(X3) ),
inference(superposition,[status(thm)],[c_1062,c_1066]) ).
cnf(c_1080,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| is_a_theorem(equivalent(X1,equivalent(X2,X0))) ),
inference(superposition,[status(thm)],[c_1063,c_1066]) ).
cnf(c_1113,plain,
is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X0),X1))),
inference(superposition,[status(thm)],[c_1063,c_1078]) ).
cnf(c_1125,plain,
( ~ is_a_theorem(X0)
| is_a_theorem(equivalent(equivalent(X1,X0),X1)) ),
inference(superposition,[status(thm)],[c_1113,c_49]) ).
cnf(c_1146,plain,
( ~ is_a_theorem(X0)
| is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(X1,X2),X0)))) ),
inference(superposition,[status(thm)],[c_1125,c_1080]) ).
cnf(c_1149,plain,
( ~ is_a_theorem(equivalent(X0,X1))
| is_a_theorem(equivalent(X1,X0)) ),
inference(superposition,[status(thm)],[c_1125,c_1077]) ).
cnf(c_1150,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| ~ is_a_theorem(equivalent(X1,X0))
| is_a_theorem(X2) ),
inference(superposition,[status(thm)],[c_1125,c_1079]) ).
cnf(c_1351,plain,
is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X1,equivalent(X2,X0)))),
inference(superposition,[status(thm)],[c_50,c_1149]) ).
cnf(c_1434,plain,
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X2)
| is_a_theorem(equivalent(equivalent(X0,X1),X2)) ),
inference(superposition,[status(thm)],[c_1146,c_1066]) ).
cnf(c_4926,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X0,X2))))
| is_a_theorem(equivalent(X2,X1)) ),
inference(superposition,[status(thm)],[c_1351,c_1150]) ).
cnf(c_7171,plain,
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(equivalent(X2,X3))
| is_a_theorem(equivalent(X2,equivalent(X3,equivalent(X0,X1)))) ),
inference(superposition,[status(thm)],[c_1434,c_1080]) ).
cnf(c_10478,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| is_a_theorem(equivalent(X2,equivalent(X0,X1))) ),
inference(superposition,[status(thm)],[c_50,c_49]) ).
cnf(c_10483,plain,
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(equivalent(X0,X2))
| is_a_theorem(equivalent(X1,X2)) ),
inference(superposition,[status(thm)],[c_7171,c_4926]) ).
cnf(c_10498,plain,
is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X0,equivalent(X1,X2)),X2))),
inference(superposition,[status(thm)],[c_50,c_10478]) ).
cnf(c_10524,plain,
( ~ is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),X3))
| is_a_theorem(equivalent(equivalent(X2,equivalent(X0,X1)),X3)) ),
inference(superposition,[status(thm)],[c_50,c_10483]) ).
cnf(c_10559,plain,
is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X1,equivalent(X2,X0))))),
inference(superposition,[status(thm)],[c_10498,c_10478]) ).
cnf(c_10602,plain,
is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X1,X0))),
inference(superposition,[status(thm)],[c_10559,c_4926]) ).
cnf(c_10831,plain,
is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(equivalent(X2,X0),X1))),
inference(superposition,[status(thm)],[c_10602,c_10524]) ).
cnf(c_18509,plain,
is_a_theorem(equivalent(X0,equivalent(equivalent(X1,equivalent(X0,X2)),equivalent(X2,X1)))),
inference(superposition,[status(thm)],[c_10831,c_10478]) ).
cnf(c_18540,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_51,c_18509]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL014-1 : TPTP v8.1.2. Released v1.0.0.
% 0.11/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n020.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Thu May 2 18:57:31 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 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
% 61.63/9.22 % SZS status Started for theBenchmark.p
% 61.63/9.22 % SZS status Unsatisfiable for theBenchmark.p
% 61.63/9.22
% 61.63/9.22 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 61.63/9.22
% 61.63/9.22 ------ iProver source info
% 61.63/9.22
% 61.63/9.22 git: date: 2024-05-02 19:28:25 +0000
% 61.63/9.22 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 61.63/9.22 git: non_committed_changes: false
% 61.63/9.22
% 61.63/9.22 ------ Parsing...successful
% 61.63/9.22
% 61.63/9.22
% 61.63/9.22
% 61.63/9.22 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 61.63/9.22
% 61.63/9.22 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 61.63/9.22 ------ Proving...
% 61.63/9.22 ------ Problem Properties
% 61.63/9.22
% 61.63/9.22
% 61.63/9.22 clauses 3
% 61.63/9.22 conjectures 1
% 61.63/9.22 EPR 0
% 61.63/9.22 Horn 3
% 61.63/9.22 unary 2
% 61.63/9.22 binary 0
% 61.63/9.22 lits 5
% 61.63/9.22 lits eq 0
% 61.63/9.22 fd_pure 0
% 61.63/9.22 fd_pseudo 0
% 61.63/9.22 fd_cond 0
% 61.63/9.22 fd_pseudo_cond 0
% 61.63/9.22 AC symbols 0
% 61.63/9.22
% 61.63/9.22 ------ Input Options Time Limit: Unbounded
% 61.63/9.22
% 61.63/9.22
% 61.63/9.22 ------
% 61.63/9.22 Current options:
% 61.63/9.22 ------
% 61.63/9.22
% 61.63/9.22
% 61.63/9.22
% 61.63/9.22
% 61.63/9.22 ------ Proving...
% 61.63/9.22
% 61.63/9.22
% 61.63/9.22 % SZS status Unsatisfiable for theBenchmark.p
% 61.63/9.22
% 61.63/9.22 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 61.63/9.22
% 61.63/9.22
%------------------------------------------------------------------------------