TSTP Solution File: LCL106-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL106-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n026.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:51 EDT 2024
% Result : Unsatisfiable 3.19s 1.18s
% Output : CNFRefutation 3.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of clauses : 13 ( 5 unt; 0 nHn; 8 RR)
% Number of literals : 24 ( 0 equ; 12 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 : 34 ( 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(X0,equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X1),X0)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',q_1) ).
cnf(c_51,plain,
is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',q_4) ).
cnf(c_52,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,a),equivalent(c,b)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_q_2) ).
cnf(c_101,plain,
( ~ is_a_theorem(X0)
| is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X1),X0))) ),
inference(superposition,[status(thm)],[c_50,c_49]) ).
cnf(c_106,plain,
( ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X2)))
| is_a_theorem(equivalent(X1,X2)) ),
inference(superposition,[status(thm)],[c_51,c_49]) ).
cnf(c_114,plain,
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X2)
| is_a_theorem(equivalent(equivalent(X1,X0),X2)) ),
inference(superposition,[status(thm)],[c_101,c_49]) ).
cnf(c_132,plain,
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(equivalent(X1,X2))
| is_a_theorem(equivalent(X0,X2)) ),
inference(superposition,[status(thm)],[c_114,c_106]) ).
cnf(c_166,plain,
( ~ is_a_theorem(equivalent(equivalent(X0,X1),X2))
| is_a_theorem(equivalent(equivalent(equivalent(X3,X0),equivalent(X3,X1)),X2)) ),
inference(superposition,[status(thm)],[c_51,c_132]) ).
cnf(c_262,plain,
( ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X2)))
| is_a_theorem(equivalent(X1,X2)) ),
inference(superposition,[status(thm)],[c_51,c_49]) ).
cnf(c_270,plain,
( ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X0),X3)))
| is_a_theorem(equivalent(equivalent(X2,X1),X3)) ),
inference(superposition,[status(thm)],[c_166,c_262]) ).
cnf(c_568,plain,
is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X0),equivalent(X2,X1)))),
inference(superposition,[status(thm)],[c_50,c_270]) ).
cnf(c_657,plain,
$false,
inference(superposition,[status(thm)],[c_568,c_52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL106-1 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n026.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 19:31:06 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/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
% 3.19/1.18 % SZS status Started for theBenchmark.p
% 3.19/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 3.19/1.18
% 3.19/1.18 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.19/1.18
% 3.19/1.18 ------ iProver source info
% 3.19/1.18
% 3.19/1.18 git: date: 2024-05-02 19:28:25 +0000
% 3.19/1.18 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.19/1.18 git: non_committed_changes: false
% 3.19/1.18
% 3.19/1.18 ------ Parsing...successful
% 3.19/1.18
% 3.19/1.18
% 3.19/1.18
% 3.19/1.18 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 3.19/1.18
% 3.19/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.19/1.18 ------ Proving...
% 3.19/1.18 ------ Problem Properties
% 3.19/1.18
% 3.19/1.18
% 3.19/1.18 clauses 4
% 3.19/1.18 conjectures 1
% 3.19/1.18 EPR 0
% 3.19/1.18 Horn 4
% 3.19/1.18 unary 3
% 3.19/1.18 binary 0
% 3.19/1.18 lits 6
% 3.19/1.18 lits eq 0
% 3.19/1.18 fd_pure 0
% 3.19/1.18 fd_pseudo 0
% 3.19/1.18 fd_cond 0
% 3.19/1.18 fd_pseudo_cond 0
% 3.19/1.18 AC symbols 0
% 3.19/1.18
% 3.19/1.18 ------ Input Options Time Limit: Unbounded
% 3.19/1.18
% 3.19/1.18
% 3.19/1.18 ------
% 3.19/1.18 Current options:
% 3.19/1.18 ------
% 3.19/1.18
% 3.19/1.18
% 3.19/1.18
% 3.19/1.18
% 3.19/1.18 ------ Proving...
% 3.19/1.18
% 3.19/1.18
% 3.19/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 3.19/1.18
% 3.19/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.19/1.18
% 3.19/1.18
%------------------------------------------------------------------------------