%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL644+1.001 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n001.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:14:50 PM UTC 2026
% Result : Theorem 0.23s 0.56s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 8 ( 3 unt; 0 def)
% Number of atoms : 534 ( 0 equ)
% Maximal formula atoms : 370 ( 66 avg)
% Number of connectives : 872 ( 346 ~; 438 |; 87 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 50 ( 18 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 67 ( 0 sgn 64 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(main,conjecture,
~ ? [X1] :
~ ( ! [X2] :
( ~ ( p1(X2)
& ! [X1] :
( p1(X1)
| ~ r1(X2,X1) ) )
| p1(X2)
| ~ r1(X1,X2) )
| ! [X2] :
( ~ ( p1(X2)
& ! [X1] :
( p1(X1)
| ~ r1(X2,X1) ) )
| p1(X2)
| ~ r1(X1,X2) )
| ~ ( ~ ( ! [X2] :
( ~ ( p1(X2)
& ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
& p1(X2) )
| p2(X2)
| p1(X2)
| ~ ( ! [X1] :
( p2(X1)
| ~ r1(X2,X1) )
& p2(X2) )
| ~ r1(X1,X2) )
& ! [X2] :
( ! [X1] :
( ~ ( p1(X1)
& ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
& p1(X1) )
| p2(X1)
| ~ r1(X2,X1) )
| p1(X2)
| ~ ( ! [X1] :
( p2(X1)
| ~ r1(X2,X1) )
& p2(X2) )
| ~ r1(X1,X2) )
& ! [X2] :
( ~ ( p1(X2)
& ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
& p1(X2) )
| p2(X2)
| ! [X1] :
( p1(X1)
| ~ ( ! [X2] :
( p2(X2)
| ~ r1(X1,X2) )
& p2(X1) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) ) )
| ! [X2] :
( ~ ( p1(X2)
& ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
& p1(X2) )
| p2(X2)
| ~ r1(X1,X2) )
| ! [X2] :
( p1(X2)
| ~ ( ! [X1] :
( p2(X1)
| ~ r1(X2,X1) )
& p2(X2) )
| ~ r1(X1,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).
fof(c_0_1,negated_conjecture,
~ ~ ? [X1] :
~ ( ! [X2] :
( ~ ( p1(X2)
& ! [X1] :
( p1(X1)
| ~ r1(X2,X1) ) )
| p1(X2)
| ~ r1(X1,X2) )
| ! [X2] :
( ~ ( p1(X2)
& ! [X1] :
( p1(X1)
| ~ r1(X2,X1) ) )
| p1(X2)
| ~ r1(X1,X2) )
| ~ ( ~ ( ! [X2] :
( ~ ( p1(X2)
& ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
& p1(X2) )
| p2(X2)
| p1(X2)
| ~ ( ! [X1] :
( p2(X1)
| ~ r1(X2,X1) )
& p2(X2) )
| ~ r1(X1,X2) )
& ! [X2] :
( ! [X1] :
( ~ ( p1(X1)
& ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
& p1(X1) )
| p2(X1)
| ~ r1(X2,X1) )
| p1(X2)
| ~ ( ! [X1] :
( p2(X1)
| ~ r1(X2,X1) )
& p2(X2) )
| ~ r1(X1,X2) )
& ! [X2] :
( ~ ( p1(X2)
& ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
& p1(X2) )
| p2(X2)
| ! [X1] :
( p1(X1)
| ~ ( ! [X2] :
( p2(X2)
| ~ r1(X1,X2) )
& p2(X1) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) ) )
| ! [X2] :
( ~ ( p1(X2)
& ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
& p1(X2) )
| p2(X2)
| ~ r1(X1,X2) )
| ! [X2] :
( p1(X2)
| ~ ( ! [X1] :
( p2(X1)
| ~ r1(X2,X1) )
& p2(X2) )
| ~ r1(X1,X2) ) ) ),
inference(assume_negation,[status(cth)],[main]) ).
fof(c_0_2,plain,
! [X1] :
( epred1_1(X1)
<=> ( ! [X2] :
( ! [X1] :
( ~ ( p1(X1)
& ! [X2] :
( p1(X2)
| ~ r1(X1,X2) )
& p1(X1) )
| p2(X1)
| ~ r1(X2,X1) )
| p1(X2)
| ~ ( ! [X1] :
( p2(X1)
| ~ r1(X2,X1) )
& p2(X2) )
| ~ r1(X1,X2) )
& ! [X2] :
( ~ ( p1(X2)
& ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
& p1(X2) )
| p2(X2)
| ! [X1] :
( p1(X1)
| ~ ( ! [X2] :
( p2(X2)
| ~ r1(X1,X2) )
& p2(X1) )
| ~ r1(X2,X1) )
| ~ r1(X1,X2) ) ) ),
introduced(definition) ).
fof(c_0_3,negated_conjecture,
~ ~ ? [X1] :
~ ( ! [X2] :
( ~ ( p1(X2)
& ! [X1] :
( p1(X1)
| ~ r1(X2,X1) ) )
| p1(X2)
| ~ r1(X1,X2) )
| ! [X2] :
( ~ ( p1(X2)
& ! [X1] :
( p1(X1)
| ~ r1(X2,X1) ) )
| p1(X2)
| ~ r1(X1,X2) )
| ~ ( ~ ( ! [X2] :
( ~ ( p1(X2)
& ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
& p1(X2) )
| p2(X2)
| p1(X2)
| ~ ( ! [X1] :
( p2(X1)
| ~ r1(X2,X1) )
& p2(X2) )
| ~ r1(X1,X2) )
& epred1_1(X1) )
| ! [X2] :
( ~ ( p1(X2)
& ! [X1] :
( p1(X1)
| ~ r1(X2,X1) )
& p1(X2) )
| p2(X2)
| ~ r1(X1,X2) )
| ! [X2] :
( p1(X2)
| ~ ( ! [X1] :
( p2(X1)
| ~ r1(X2,X1) )
& p2(X2) )
| ~ r1(X1,X2) ) ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_1]),c_0_2]) ).
fof(c_0_4,negated_conjecture,
! [X4,X6,X9,X10,X12,X14] :
( p1(esk6_0)
& ( p1(X14)
| ~ r1(esk6_0,X14) )
& ~ p1(esk6_0)
& r1(esk1_0,esk6_0)
& p1(esk5_0)
& ( p1(X12)
| ~ r1(esk5_0,X12) )
& ~ p1(esk5_0)
& r1(esk1_0,esk5_0)
& ( p1(X4)
| ~ r1(esk1_0,X4)
| ~ p2(X4)
| ~ p2(esk2_1(X4))
| p2(X6)
| ~ r1(esk1_0,X6)
| ~ p1(X6)
| ~ p1(X6)
| ~ p1(esk3_1(X6))
| ~ epred1_1(esk1_0)
| p1(esk4_0) )
& ( p1(X4)
| ~ r1(esk1_0,X4)
| ~ p2(X4)
| ~ p2(esk2_1(X4))
| p2(X6)
| ~ r1(esk1_0,X6)
| ~ p1(X6)
| ~ p1(X6)
| ~ p1(esk3_1(X6))
| ~ epred1_1(esk1_0)
| p1(X10)
| ~ r1(esk4_0,X10) )
& ( p1(X4)
| ~ r1(esk1_0,X4)
| ~ p2(X4)
| ~ p2(esk2_1(X4))
| p2(X6)
| ~ r1(esk1_0,X6)
| ~ p1(X6)
| ~ p1(X6)
| ~ p1(esk3_1(X6))
| ~ epred1_1(esk1_0)
| p1(esk4_0) )
& ( p1(X4)
| ~ r1(esk1_0,X4)
| ~ p2(X4)
| ~ p2(esk2_1(X4))
| p2(X6)
| ~ r1(esk1_0,X6)
| ~ p1(X6)
| ~ p1(X6)
| ~ p1(esk3_1(X6))
| ~ epred1_1(esk1_0)
| ~ p2(esk4_0) )
& ( p1(X4)
| ~ r1(esk1_0,X4)
| ~ p2(X4)
| ~ p2(esk2_1(X4))
| p2(X6)
| ~ r1(esk1_0,X6)
| ~ p1(X6)
| ~ p1(X6)
| ~ p1(esk3_1(X6))
| ~ epred1_1(esk1_0)
| ~ p1(esk4_0) )
& ( p1(X4)
| ~ r1(esk1_0,X4)
| ~ p2(X4)
| ~ p2(esk2_1(X4))
| p2(X6)
| ~ r1(esk1_0,X6)
| ~ p1(X6)
| ~ p1(X6)
| ~ p1(esk3_1(X6))
| ~ epred1_1(esk1_0)
| p2(X9)
| ~ r1(esk4_0,X9) )
& ( p1(X4)
| ~ r1(esk1_0,X4)
| ~ p2(X4)
| ~ p2(esk2_1(X4))
| p2(X6)
| ~ r1(esk1_0,X6)
| ~ p1(X6)
| ~ p1(X6)
| ~ p1(esk3_1(X6))
| ~ epred1_1(esk1_0)
| p2(esk4_0) )
& ( p1(X4)
| ~ r1(esk1_0,X4)
| ~ p2(X4)
| ~ p2(esk2_1(X4))
| p2(X6)
| ~ r1(esk1_0,X6)
| ~ p1(X6)
| ~ p1(X6)
| ~ p1(esk3_1(X6))
| ~ epred1_1(esk1_0)
| r1(esk1_0,esk4_0) )
& ( p1(X4)
| ~ r1(esk1_0,X4)
| ~ p2(X4)
| ~ p2(esk2_1(X4))
| p2(X6)
| ~ r1(esk1_0,X6)
| ~ p1(X6)
| ~ p1(X6)
| r1(X6,esk3_1(X6))
| ~ epred1_1(esk1_0)
| p1(esk4_0) )
& ( p1(X4)
| ~ r1(esk1_0,X4)
| ~ p2(X4)
| ~ p2(esk2_1(X4))
| p2(X6)
| ~ r1(esk1_0,X6)
| ~ p1(X6)
| ~ p1(X6)
| r1(X6,esk3_1(X6))
| ~ epred1_1(esk1_0)
| p1(X10)
| ~ r1(esk4_0,X10) )
& ( p1(X4)
| ~ r1(esk1_0,X4)
| ~ p2(X4)
| ~ p2(esk2_1(X4))
| p2(X6)
| ~ r1(esk1_0,X6)
| ~ p1(X6)
| ~ p1(X6)
| r1(X6,esk3_1(X6))
| ~ epred1_1(esk1_0)
| p1(esk4_0) )
& ( p1(X4)
| ~ r1(esk1_0,X4)
| ~ p2(X4)
| ~ p2(esk2_1(X4))
| p2(X6)
| ~ r1(esk1_0,X6)
| ~ p1(X6)
| ~ p1(X6)
| r1(X6,esk3_1(X6))
| ~ epred1_1(esk1_0)
| ~ p2(esk4_0) )
& ( p1(X4)
| ~ r1(esk1_0,X4)
| ~ p2(X4)
| ~ p2(esk2_1(X4))
| p2(X6)
| ~ r1(esk1_0,X6)
| ~ p1(X6)
| ~ p1(X6)
| r1(X6,esk3_1(X6))
| ~ epred1_1(esk1_0)
| ~ p1(esk4_0) )
& ( p1(X4)
| ~ r1(esk1_0,X4)
| ~ p2(X4)
| ~ p2(esk2_1(X4))
| p2(X6)
| ~ r1(esk1_0,X6)
| ~ p1(X6)
| ~ p1(X6)
| r1(X6,esk3_1(X6))
| ~ epred1_1(esk1_0)
| p2(X9)
| ~ r1(esk4_0,X9) )
& ( p1(X4)
| ~ r1(esk1_0,X4)
| ~ p2(X4)
| ~ p2(esk2_1(X4))
| p2(X6)
| ~ r1(esk1_0,X6)
| ~ p1(X6)
| ~ p1(X6)
| r1(X6,esk3_1(X6))
| ~ epred1_1(esk1_0)
| p2(esk4_0) )
& ( p1(X4)
| ~ r1(esk1_0,X4)
| ~ p2(X4)
| ~ p2(esk2_1(X4))
| p2(X6)
| ~ r1(esk1_0,X6)
| ~ p1(X6)
| ~ p1(X6)
| r1(X6,esk3_1(X6))
| ~ epred1_1(esk1_0)
| r1(esk1_0,esk4_0) )
& ( p1(X4)
| ~ r1(esk1_0,X4)
| ~ p2(X4)
| r1(X4,esk2_1(X4))
| p2(X6)
| ~ r1(esk1_0,X6)
| ~ p1(X6)
| ~ p1(X6)
| ~ p1(esk3_1(X6))
| ~ epred1_1(esk1_0)
| p1(esk4_0) )
& ( p1(X4)
| ~ r1(esk1_0,X4)
| ~ p2(X4)
| r1(X4,esk2_1(X4))
| p2(X6)
| ~ r1(esk1_0,X6)
| ~ p1(X6)
| ~ p1(X6)
| ~ p1(esk3_1(X6))
| ~ epred1_1(esk1_0)
| p1(X10)
| ~ r1(esk4_0,X10) )
& ( p1(X4)
| ~ r1(esk1_0,X4)
| ~ p2(X4)
| r1(X4,esk2_1(X4))
| p2(X6)
| ~ r1(esk1_0,X6)
| ~ p1(X6)
| ~ p1(X6)
| ~ p1(esk3_1(X6))
| ~ epred1_1(esk1_0)
| p1(esk4_0) )
& ( p1(X4)
| ~ r1(esk1_0,X4)
| ~ p2(X4)
| r1(X4,esk2_1(X4))
| p2(X6)
| ~ r1(esk1_0,X6)
| ~ p1(X6)
| ~ p1(X6)
| ~ p1(esk3_1(X6))
| ~ epred1_1(esk1_0)
| ~ p2(esk4_0) )
& ( p1(X4)
| ~ r1(esk1_0,X4)
| ~ p2(X4)
| r1(X4,esk2_1(X4))
| p2(X6)
| ~ r1(esk1_0,X6)
| ~ p1(X6)
| ~ p1(X6)
| ~ p1(esk3_1(X6))
| ~ epred1_1(esk1_0)
| ~ p1(esk4_0) )
& ( p1(X4)
| ~ r1(esk1_0,X4)
| ~ p2(X4)
| r1(X4,esk2_1(X4))
| p2(X6)
| ~ r1(esk1_0,X6)
| ~ p1(X6)
| ~ p1(X6)
| ~ p1(esk3_1(X6))
| ~ epred1_1(esk1_0)
| p2(X9)
| ~ r1(esk4_0,X9) )
& ( p1(X4)
| ~ r1(esk1_0,X4)
| ~ p2(X4)
| r1(X4,esk2_1(X4))
| p2(X6)
| ~ r1(esk1_0,X6)
| ~ p1(X6)
| ~ p1(X6)
| ~ p1(esk3_1(X6))
| ~ epred1_1(esk1_0)
| p2(esk4_0) )
& ( p1(X4)
| ~ r1(esk1_0,X4)
| ~ p2(X4)
| r1(X4,esk2_1(X4))
| p2(X6)
| ~ r1(esk1_0,X6)
| ~ p1(X6)
| ~ p1(X6)
| ~ p1(esk3_1(X6))
| ~ epred1_1(esk1_0)
| r1(esk1_0,esk4_0) )
& ( p1(X4)
| ~ r1(esk1_0,X4)
| ~ p2(X4)
| r1(X4,esk2_1(X4))
| p2(X6)
| ~ r1(esk1_0,X6)
| ~ p1(X6)
| ~ p1(X6)
| r1(X6,esk3_1(X6))
| ~ epred1_1(esk1_0)
| p1(esk4_0) )
& ( p1(X4)
| ~ r1(esk1_0,X4)
| ~ p2(X4)
| r1(X4,esk2_1(X4))
| p2(X6)
| ~ r1(esk1_0,X6)
| ~ p1(X6)
| ~ p1(X6)
| r1(X6,esk3_1(X6))
| ~ epred1_1(esk1_0)
| p1(X10)
| ~ r1(esk4_0,X10) )
& ( p1(X4)
| ~ r1(esk1_0,X4)
| ~ p2(X4)
| r1(X4,esk2_1(X4))
| p2(X6)
| ~ r1(esk1_0,X6)
| ~ p1(X6)
| ~ p1(X6)
| r1(X6,esk3_1(X6))
| ~ epred1_1(esk1_0)
| p1(esk4_0) )
& ( p1(X4)
| ~ r1(esk1_0,X4)
| ~ p2(X4)
| r1(X4,esk2_1(X4))
| p2(X6)
| ~ r1(esk1_0,X6)
| ~ p1(X6)
| ~ p1(X6)
| r1(X6,esk3_1(X6))
| ~ epred1_1(esk1_0)
| ~ p2(esk4_0) )
& ( p1(X4)
| ~ r1(esk1_0,X4)
| ~ p2(X4)
| r1(X4,esk2_1(X4))
| p2(X6)
| ~ r1(esk1_0,X6)
| ~ p1(X6)
| ~ p1(X6)
| r1(X6,esk3_1(X6))
| ~ epred1_1(esk1_0)
| ~ p1(esk4_0) )
& ( p1(X4)
| ~ r1(esk1_0,X4)
| ~ p2(X4)
| r1(X4,esk2_1(X4))
| p2(X6)
| ~ r1(esk1_0,X6)
| ~ p1(X6)
| ~ p1(X6)
| r1(X6,esk3_1(X6))
| ~ epred1_1(esk1_0)
| p2(X9)
| ~ r1(esk4_0,X9) )
& ( p1(X4)
| ~ r1(esk1_0,X4)
| ~ p2(X4)
| r1(X4,esk2_1(X4))
| p2(X6)
| ~ r1(esk1_0,X6)
| ~ p1(X6)
| ~ p1(X6)
| r1(X6,esk3_1(X6))
| ~ epred1_1(esk1_0)
| p2(esk4_0) )
& ( p1(X4)
| ~ r1(esk1_0,X4)
| ~ p2(X4)
| r1(X4,esk2_1(X4))
| p2(X6)
| ~ r1(esk1_0,X6)
| ~ p1(X6)
| ~ p1(X6)
| r1(X6,esk3_1(X6))
| ~ epred1_1(esk1_0)
| r1(esk1_0,esk4_0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])])]) ).
cnf(c_0_5,negated_conjecture,
~ p1(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_6,negated_conjecture,
p1(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL644+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.45 % Computer : n001.cluster.edu
% 0.18/0.45 % Model : x86_64 x86_64
% 0.18/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45 % Memory : 8046.5625MB
% 0.18/0.45 % OS : Linux 6.8.0-71-generic
% 0.18/0.45 % CPULimit : 300
% 0.18/0.45 % WCLimit : 300
% 0.18/0.45 % DateTime : Mon Sep 21 00:49:00 UTC 2026
% 0.18/0.45 % CPUTime :
% 0.18/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.23/0.56 % Version: 3.5.1
% 0.23/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.56 % Starting sh5l with 300s (1) cores
% 0.23/0.56 % new_bool_3 with pid 1842463 completed with status 0
% 0.23/0.56 % Result found by new_bool_3
% 0.23/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.56 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.56 % Search class: FGUNF-FSLS11-SFFFFFNN
% 0.23/0.56 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.56 % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.56 % SubtermCWHack with pid 1842466 completed with status 0
% 0.23/0.56 % Result found by SubtermCWHack
% 0.23/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.56 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.56 % Search class: FGUNF-FSLS11-SFFFFFNN
% 0.23/0.56 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.56 % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.56 % Preprocessing time : 0.004 s
% 0.23/0.56
% 0.23/0.56 % Proof found!
% 0.23/0.56 % SZS status Theorem
% 0.23/0.56 % SZS output start CNFRefutation
% See solution above
% 0.23/0.56 % Parsed axioms : 1
% 0.23/0.56 % Removed by relevancy pruning/SinE : 0
% 0.23/0.56 % Initial clauses : 121
% 0.23/0.56 % Removed in clause preprocessing : 0
% 0.23/0.56 % Initial clauses in saturation : 121
% 0.23/0.56 % Processed clauses : 3
% 0.23/0.56 % ...of these trivial : 0
% 0.23/0.56 % ...subsumed : 0
% 0.23/0.56 % ...remaining for further processing : 2
% 0.23/0.56 % Other redundant clauses eliminated : 0
% 0.23/0.56 % Clauses deleted for lack of memory : 0
% 0.23/0.56 % Backward-subsumed : 0
% 0.23/0.56 % Backward-rewritten : 0
% 0.23/0.56 % Generated clauses : 0
% 0.23/0.56 % ...of the previous two non-redundant : 0
% 0.23/0.56 % ...aggressively subsumed : 0
% 0.23/0.56 % Contextual simplify-reflections : 0
% 0.23/0.56 % Paramodulations : 0
% 0.23/0.56 % Factorizations : 0
% 0.23/0.56 % NegExts : 0
% 0.23/0.56 % Equation resolutions : 0
% 0.23/0.56 % Disequality decompositions : 0
% 0.23/0.56 % Total rewrite steps : 1
% 0.23/0.56 % ...of those cached : 0
% 0.23/0.56 % Propositional unsat checks : 0
% 0.23/0.56 % Propositional check models : 0
% 0.23/0.56 % Propositional check unsatisfiable : 0
% 0.23/0.56 % Propositional clauses : 0
% 0.23/0.56 % Propositional clauses after purity: 0
% 0.23/0.56 % Propositional unsat core size : 0
% 0.23/0.56 % Propositional preprocessing time : 0.000
% 0.23/0.56 % Propositional encoding time : 0.000
% 0.23/0.56 % Propositional solver time : 0.000
% 0.23/0.56 % Success case prop preproc time : 0.000
% 0.23/0.56 % Success case prop encoding time : 0.000
% 0.23/0.56 % Success case prop solver time : 0.000
% 0.23/0.56 % Current number of processed clauses : 2
% 0.23/0.56 % Positive orientable unit clauses : 2
% 0.23/0.56 % Positive unorientable unit clauses: 0
% 0.23/0.56 % Negative unit clauses : 0
% 0.23/0.56 % Non-unit-clauses : 0
% 0.23/0.56 % Current number of unprocessed clauses: 118
% 0.23/0.56 % ...number of literals in the above : 614
% 0.23/0.56 % Current number of archived formulas : 0
% 0.23/0.56 % Current number of archived clauses : 0
% 0.23/0.56 % Clause-clause subsumption calls (NU) : 0
% 0.23/0.56 % Rec. Clause-clause subsumption calls : 0
% 0.23/0.56 % Non-unit clause-clause subsumptions : 0
% 0.23/0.56 % Unit Clause-clause subsumption calls : 0
% 0.23/0.56 % Rewrite failures with RHS unbound : 0
% 0.23/0.56 % BW rewrite match attempts : 0
% 0.23/0.56 % BW rewrite match successes : 0
% 0.23/0.56 % Condensation attempts : 0
% 0.23/0.56 % Condensation successes : 0
% 0.23/0.56 % Termbank termtop insertions : 5592
% 0.23/0.56 % Search garbage collected termcells : 891
% 0.23/0.56
% 0.23/0.56 % -------------------------------------------------
% 0.23/0.56 % User time : 0.011 s
% 0.23/0.56 % System time : 0.004 s
% 0.23/0.56 % Total time : 0.015 s
% 0.23/0.56 % Maximum resident set size: 3836 pages
% 0.23/0.56
% 0.23/0.56 % -------------------------------------------------
% 0.23/0.56 % User time : 0.014 s
% 0.23/0.56 % System time : 0.009 s
% 0.23/0.56 % Total time : 0.023 s
% 0.23/0.56 % Maximum resident set size: 4608 pages
% 0.23/0.56 % E exiting
%------------------------------------------------------------------------------