TSTP Solution File: LCL011-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LCL011-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 : Thu Aug 31 07:42:02 EDT 2023
% Result : Unsatisfiable 4.11s 1.15s
% Output : CNFRefutation 4.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 49
% Number of leaves : 3
% Syntax : Number of clauses : 63 ( 15 unt; 0 nHn; 57 RR)
% Number of literals : 131 ( 0 equ; 117 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 7 ( 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 ( 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,X0),equivalent(X1,X2)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',yqj) ).
cnf(c_51,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(a,c),equivalent(c,b)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_yqf) ).
cnf(c_68,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(a,b),equivalent(equivalent(a,c),equivalent(c,b)))))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c_49,c_51]) ).
cnf(c_72,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(equivalent(a,b),equivalent(equivalent(a,c),equivalent(c,b))))))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(X1) ),
inference(resolution,[status(thm)],[c_68,c_49]) ).
cnf(c_81,plain,
( ~ is_a_theorem(equivalent(equivalent(equivalent(a,c),equivalent(c,b)),X0))
| ~ is_a_theorem(equivalent(X0,equivalent(a,b))) ),
inference(resolution,[status(thm)],[c_72,c_50]) ).
cnf(c_91,plain,
~ is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(a,c)),equivalent(equivalent(c,b),X0)),equivalent(a,b))),
inference(resolution,[status(thm)],[c_81,c_50]) ).
cnf(c_93,plain,
( ~ is_a_theorem(equivalent(X0,X1))
| is_a_theorem(equivalent(equivalent(X2,X0),equivalent(X1,X2))) ),
inference(superposition,[status(thm)],[c_50,c_49]) ).
cnf(c_95,plain,
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(equivalent(X2,X0))
| is_a_theorem(equivalent(X1,X2)) ),
inference(superposition,[status(thm)],[c_93,c_49]) ).
cnf(c_105,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(X1,equivalent(a,c)),equivalent(equivalent(c,b),X1)),equivalent(a,b))))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c_91,c_49]) ).
cnf(c_107,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| is_a_theorem(equivalent(equivalent(equivalent(X3,X1),equivalent(X2,X3)),X0)) ),
inference(superposition,[status(thm)],[c_50,c_95]) ).
cnf(c_113,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(equivalent(equivalent(X2,equivalent(a,c)),equivalent(equivalent(c,b),X2)),equivalent(a,b)))))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(X1) ),
inference(resolution,[status(thm)],[c_105,c_49]) ).
cnf(c_139,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,equivalent(a,c)),equivalent(equivalent(c,b),X1))))
| ~ is_a_theorem(equivalent(equivalent(a,b),X0)) ),
inference(resolution,[status(thm)],[c_113,c_50]) ).
cnf(c_146,plain,
( ~ is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X2,X0)))
| ~ is_a_theorem(equivalent(X3,equivalent(X1,X2)))
| is_a_theorem(X3) ),
inference(superposition,[status(thm)],[c_107,c_49]) ).
cnf(c_151,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(equivalent(X2,equivalent(a,c)),equivalent(equivalent(c,b),X2)))))
| ~ is_a_theorem(equivalent(equivalent(a,b),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c_139,c_49]) ).
cnf(c_180,plain,
( ~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(equivalent(c,b),X0),X1)))
| ~ is_a_theorem(equivalent(X1,equivalent(X0,equivalent(a,c)))) ),
inference(resolution,[status(thm)],[c_151,c_50]) ).
cnf(c_208,plain,
~ is_a_theorem(equivalent(equivalent(b,equivalent(c,b)),equivalent(a,equivalent(a,c)))),
inference(resolution,[status(thm)],[c_180,c_50]) ).
cnf(c_215,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(b,equivalent(c,b)),equivalent(a,equivalent(a,c)))))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c_208,c_49]) ).
cnf(c_219,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(equivalent(b,equivalent(c,b)),equivalent(a,equivalent(a,c))))))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(X1) ),
inference(resolution,[status(thm)],[c_215,c_49]) ).
cnf(c_252,plain,
( ~ is_a_theorem(equivalent(equivalent(a,equivalent(a,c)),X0))
| ~ is_a_theorem(equivalent(X0,equivalent(b,equivalent(c,b)))) ),
inference(resolution,[status(thm)],[c_219,c_50]) ).
cnf(c_254,plain,
( ~ is_a_theorem(equivalent(X0,X1))
| is_a_theorem(equivalent(equivalent(X2,X0),equivalent(X1,X2))) ),
inference(superposition,[status(thm)],[c_50,c_49]) ).
cnf(c_266,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X2,equivalent(X1,X2)))))
| is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_50,c_146]) ).
cnf(c_280,plain,
~ is_a_theorem(equivalent(equivalent(equivalent(X0,a),equivalent(equivalent(a,c),X0)),equivalent(b,equivalent(c,b)))),
inference(resolution,[status(thm)],[c_252,c_50]) ).
cnf(c_283,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(X1,a),equivalent(equivalent(a,c),X1)),equivalent(b,equivalent(c,b)))))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c_280,c_49]) ).
cnf(c_287,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(equivalent(equivalent(X2,a),equivalent(equivalent(a,c),X2)),equivalent(b,equivalent(c,b))))))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(X1) ),
inference(resolution,[status(thm)],[c_283,c_49]) ).
cnf(c_327,plain,
( ~ is_a_theorem(equivalent(X0,X1))
| is_a_theorem(equivalent(equivalent(X2,equivalent(X1,X2)),X0)) ),
inference(superposition,[status(thm)],[c_254,c_266]) ).
cnf(c_359,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,a),equivalent(equivalent(a,c),X1))))
| ~ is_a_theorem(equivalent(equivalent(b,equivalent(c,b)),X0)) ),
inference(resolution,[status(thm)],[c_287,c_50]) ).
cnf(c_367,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(equivalent(X2,a),equivalent(equivalent(a,c),X2)))))
| ~ is_a_theorem(equivalent(equivalent(b,equivalent(c,b)),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c_359,c_49]) ).
cnf(c_408,plain,
( ~ is_a_theorem(equivalent(equivalent(b,equivalent(c,b)),equivalent(equivalent(equivalent(a,c),X0),X1)))
| ~ is_a_theorem(equivalent(X1,equivalent(X0,a))) ),
inference(resolution,[status(thm)],[c_367,c_50]) ).
cnf(c_412,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X0)))
| ~ is_a_theorem(equivalent(X2,X1))
| is_a_theorem(X2) ),
inference(superposition,[status(thm)],[c_327,c_49]) ).
cnf(c_425,plain,
~ is_a_theorem(equivalent(equivalent(equivalent(c,b),equivalent(a,c)),equivalent(b,a))),
inference(resolution,[status(thm)],[c_408,c_50]) ).
cnf(c_446,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(c,b),equivalent(a,c)),equivalent(b,a))))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c_425,c_49]) ).
cnf(c_450,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(equivalent(equivalent(c,b),equivalent(a,c)),equivalent(b,a)))))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(X1) ),
inference(resolution,[status(thm)],[c_446,c_49]) ).
cnf(c_493,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(c,b),equivalent(a,c))))
| ~ is_a_theorem(equivalent(equivalent(b,a),X0)) ),
inference(resolution,[status(thm)],[c_450,c_50]) ).
cnf(c_521,plain,
~ is_a_theorem(equivalent(equivalent(b,a),equivalent(b,a))),
inference(resolution,[status(thm)],[c_493,c_50]) ).
cnf(c_527,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X1)))
| is_a_theorem(X0) ),
inference(superposition,[status(thm)],[c_50,c_412]) ).
cnf(c_532,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(b,a),equivalent(b,a))))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c_521,c_49]) ).
cnf(c_536,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(equivalent(b,a),equivalent(b,a)))))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(X1) ),
inference(resolution,[status(thm)],[c_532,c_49]) ).
cnf(c_587,plain,
is_a_theorem(equivalent(X0,X0)),
inference(superposition,[status(thm)],[c_50,c_527]) ).
cnf(c_591,plain,
is_a_theorem(equivalent(a,a)),
inference(instantiation,[status(thm)],[c_587]) ).
cnf(c_630,plain,
( ~ is_a_theorem(equivalent(equivalent(b,a),X0))
| ~ is_a_theorem(equivalent(X0,equivalent(b,a))) ),
inference(resolution,[status(thm)],[c_536,c_50]) ).
cnf(c_646,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(b,a))))
| ~ is_a_theorem(equivalent(equivalent(b,a),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c_630,c_49]) ).
cnf(c_744,plain,
( ~ is_a_theorem(equivalent(equivalent(b,a),equivalent(a,X0)))
| ~ is_a_theorem(equivalent(X0,b)) ),
inference(resolution,[status(thm)],[c_646,c_50]) ).
cnf(c_748,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(b,a),equivalent(a,X1))))
| ~ is_a_theorem(equivalent(X1,b))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c_744,c_49]) ).
cnf(c_867,plain,
( ~ is_a_theorem(equivalent(a,a))
| ~ is_a_theorem(equivalent(b,b)) ),
inference(resolution,[status(thm)],[c_748,c_50]) ).
cnf(c_868,plain,
~ is_a_theorem(equivalent(b,b)),
inference(global_subsumption_just,[status(thm)],[c_867,c_591,c_867]) ).
cnf(c_875,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(b,b)))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c_868,c_49]) ).
cnf(c_892,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(b,b))))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(X1) ),
inference(resolution,[status(thm)],[c_875,c_49]) ).
cnf(c_945,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(X2,equivalent(b,b)))))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X2) ),
inference(resolution,[status(thm)],[c_892,c_49]) ).
cnf(c_2139,plain,
( ~ is_a_theorem(equivalent(equivalent(b,b),X0))
| ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X1) ),
inference(resolution,[status(thm)],[c_945,c_50]) ).
cnf(c_2207,plain,
( ~ is_a_theorem(equivalent(equivalent(equivalent(X0,b),equivalent(b,X0)),X1))
| ~ is_a_theorem(X1) ),
inference(resolution,[status(thm)],[c_2139,c_50]) ).
cnf(c_2211,plain,
~ is_a_theorem(equivalent(equivalent(X0,equivalent(X1,b)),equivalent(equivalent(b,X1),X0))),
inference(resolution,[status(thm)],[c_2207,c_50]) ).
cnf(c_2214,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,equivalent(X2,b)),equivalent(equivalent(b,X2),X1))))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c_2211,c_49]) ).
cnf(c_2265,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(equivalent(X2,equivalent(X3,b)),equivalent(equivalent(b,X3),X2)))))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(X1) ),
inference(resolution,[status(thm)],[c_2214,c_49]) ).
cnf(c_2601,plain,
( ~ is_a_theorem(equivalent(equivalent(equivalent(b,X0),X1),X2))
| ~ is_a_theorem(equivalent(X2,equivalent(X1,equivalent(X0,b)))) ),
inference(resolution,[status(thm)],[c_2265,c_50]) ).
cnf(c_2621,plain,
~ is_a_theorem(equivalent(equivalent(equivalent(b,X0),equivalent(b,X1)),equivalent(X1,X0))),
inference(resolution,[status(thm)],[c_2601,c_50]) ).
cnf(c_2699,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(b,X1),equivalent(b,X2)),equivalent(X2,X1))))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c_2621,c_49]) ).
cnf(c_2720,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(equivalent(equivalent(b,X2),equivalent(b,X3)),equivalent(X3,X2)))))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(X1) ),
inference(resolution,[status(thm)],[c_2699,c_49]) ).
cnf(c_3150,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(b,X1),equivalent(b,X2))))
| ~ is_a_theorem(equivalent(equivalent(X2,X1),X0)) ),
inference(resolution,[status(thm)],[c_2720,c_50]) ).
cnf(c_3170,plain,
~ is_a_theorem(equivalent(equivalent(b,X0),equivalent(X0,b))),
inference(resolution,[status(thm)],[c_3150,c_50]) ).
cnf(c_3173,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(b,X1),equivalent(X1,b))))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c_3170,c_49]) ).
cnf(c_3179,plain,
~ is_a_theorem(equivalent(X0,X0)),
inference(resolution,[status(thm)],[c_3173,c_50]) ).
cnf(c_3180,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_3179,c_587]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL011-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n020.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri Aug 25 02:21:30 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.11/1.15 % SZS status Started for theBenchmark.p
% 4.11/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 4.11/1.15
% 4.11/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 4.11/1.15
% 4.11/1.15 ------ iProver source info
% 4.11/1.15
% 4.11/1.15 git: date: 2023-05-31 18:12:56 +0000
% 4.11/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 4.11/1.15 git: non_committed_changes: false
% 4.11/1.15 git: last_make_outside_of_git: false
% 4.11/1.15
% 4.11/1.15 ------ Parsing...successful
% 4.11/1.15
% 4.11/1.15
% 4.11/1.15
% 4.11/1.15 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 4.11/1.15
% 4.11/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.11/1.15 ------ Proving...
% 4.11/1.15 ------ Problem Properties
% 4.11/1.15
% 4.11/1.15
% 4.11/1.15 clauses 3
% 4.11/1.15 conjectures 1
% 4.11/1.15 EPR 0
% 4.11/1.15 Horn 3
% 4.11/1.15 unary 2
% 4.11/1.15 binary 0
% 4.11/1.15 lits 5
% 4.11/1.15 lits eq 0
% 4.11/1.15 fd_pure 0
% 4.11/1.15 fd_pseudo 0
% 4.11/1.15 fd_cond 0
% 4.11/1.15 fd_pseudo_cond 0
% 4.11/1.15 AC symbols 0
% 4.11/1.15
% 4.11/1.15 ------ Input Options Time Limit: Unbounded
% 4.11/1.15
% 4.11/1.15
% 4.11/1.15 ------
% 4.11/1.15 Current options:
% 4.11/1.15 ------
% 4.11/1.15
% 4.11/1.15
% 4.11/1.15
% 4.11/1.15
% 4.11/1.15 ------ Proving...
% 4.11/1.15
% 4.11/1.15
% 4.11/1.15 % SZS status Unsatisfiable for theBenchmark.p
% 4.11/1.15
% 4.11/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.11/1.15
% 4.11/1.15
%------------------------------------------------------------------------------