TSTP Solution File: SEV000^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV000^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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 : Tue May 21 04:07:11 EDT 2024
% Result : Theorem 1.42s 0.70s
% Output : CNFRefutation 1.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 50 ( 32 unt; 9 typ; 0 def)
% Number of atoms : 82 ( 81 equ; 0 cnn)
% Maximal formula atoms : 15 ( 2 avg)
% Number of connectives : 592 ( 13 ~; 11 |; 24 &; 538 @)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 35 ( 5 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 146 ( 0 ^ 146 !; 0 ?; 146 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
esk1_0: a > a > a ).
thf(decl_23,type,
esk2_0: a > a > a ).
thf(decl_24,type,
esk3_0: a ).
thf(decl_25,type,
esk4_0: a ).
thf(decl_26,type,
esk5_0: a ).
thf(decl_27,type,
esk6_0: a ).
thf(decl_28,type,
esk7_0: a ).
thf(decl_29,type,
esk8_0: a ).
thf(cMODULAR_EQUIV_THM_pme,conjecture,
! [X1: a > a > a,X2: a > a > a] :
( ( ! [X3: a] :
( ( X1 @ X3 @ X3 )
= X3 )
& ! [X3: a] :
( ( X2 @ X3 @ X3 )
= X3 )
& ! [X3: a,X4: a,X5: a] :
( ( X1 @ ( X1 @ X3 @ X4 ) @ X5 )
= ( X1 @ X3 @ ( X1 @ X4 @ X5 ) ) )
& ! [X3: a,X4: a,X5: a] :
( ( X2 @ ( X2 @ X3 @ X4 ) @ X5 )
= ( X2 @ X3 @ ( X2 @ X4 @ X5 ) ) )
& ! [X3: a,X4: a] :
( ( X1 @ X3 @ X4 )
= ( X1 @ X4 @ X3 ) )
& ! [X3: a,X4: a] :
( ( X2 @ X3 @ X4 )
= ( X2 @ X4 @ X3 ) )
& ! [X3: a,X4: a] :
( ( X1 @ ( X2 @ X3 @ X4 ) @ X4 )
= X4 )
& ! [X3: a,X4: a] :
( ( X2 @ ( X1 @ X3 @ X4 ) @ X4 )
= X4 ) )
=> ( ! [X3: a,X4: a,X5: a] :
( ( ( X1 @ X3 @ X5 )
= X5 )
=> ( ( X1 @ X3 @ ( X2 @ X4 @ X5 ) )
= ( X2 @ ( X1 @ X3 @ X4 ) @ X5 ) ) )
<=> ! [X3: a,X4: a,X5: a] :
( ( X1 @ X3 @ ( X2 @ X4 @ ( X1 @ X3 @ X5 ) ) )
= ( X2 @ ( X1 @ X3 @ X4 ) @ ( X1 @ X3 @ X5 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cMODULAR_EQUIV_THM_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: a > a > a,X2: a > a > a] :
( ( ! [X3: a] :
( ( X1 @ X3 @ X3 )
= X3 )
& ! [X3: a] :
( ( X2 @ X3 @ X3 )
= X3 )
& ! [X3: a,X4: a,X5: a] :
( ( X1 @ ( X1 @ X3 @ X4 ) @ X5 )
= ( X1 @ X3 @ ( X1 @ X4 @ X5 ) ) )
& ! [X3: a,X4: a,X5: a] :
( ( X2 @ ( X2 @ X3 @ X4 ) @ X5 )
= ( X2 @ X3 @ ( X2 @ X4 @ X5 ) ) )
& ! [X3: a,X4: a] :
( ( X1 @ X3 @ X4 )
= ( X1 @ X4 @ X3 ) )
& ! [X3: a,X4: a] :
( ( X2 @ X3 @ X4 )
= ( X2 @ X4 @ X3 ) )
& ! [X3: a,X4: a] :
( ( X1 @ ( X2 @ X3 @ X4 ) @ X4 )
= X4 )
& ! [X3: a,X4: a] :
( ( X2 @ ( X1 @ X3 @ X4 ) @ X4 )
= X4 ) )
=> ( ! [X3: a,X4: a,X5: a] :
( ( ( X1 @ X3 @ X5 )
= X5 )
=> ( ( X1 @ X3 @ ( X2 @ X4 @ X5 ) )
= ( X2 @ ( X1 @ X3 @ X4 ) @ X5 ) ) )
<=> ! [X3: a,X4: a,X5: a] :
( ( X1 @ X3 @ ( X2 @ X4 @ ( X1 @ X3 @ X5 ) ) )
= ( X2 @ ( X1 @ X3 @ X4 ) @ ( X1 @ X3 @ X5 ) ) ) ) ),
inference(assume_negation,[status(cth)],[cMODULAR_EQUIV_THM_pme]) ).
thf(c_0_2,negated_conjecture,
! [X32: a,X33: a,X34: a,X35: a,X36: a,X37: a,X38: a,X39: a,X40: a,X41: a,X42: a,X43: a,X44: a,X45: a,X46: a,X47: a,X54: a,X55: a,X56: a,X57: a,X58: a,X59: a] :
( ( ( esk1_0 @ X32 @ X32 )
= X32 )
& ( ( esk2_0 @ X33 @ X33 )
= X33 )
& ( ( esk1_0 @ ( esk1_0 @ X34 @ X35 ) @ X36 )
= ( esk1_0 @ X34 @ ( esk1_0 @ X35 @ X36 ) ) )
& ( ( esk2_0 @ ( esk2_0 @ X37 @ X38 ) @ X39 )
= ( esk2_0 @ X37 @ ( esk2_0 @ X38 @ X39 ) ) )
& ( ( esk1_0 @ X40 @ X41 )
= ( esk1_0 @ X41 @ X40 ) )
& ( ( esk2_0 @ X42 @ X43 )
= ( esk2_0 @ X43 @ X42 ) )
& ( ( esk1_0 @ ( esk2_0 @ X44 @ X45 ) @ X45 )
= X45 )
& ( ( esk2_0 @ ( esk1_0 @ X46 @ X47 ) @ X47 )
= X47 )
& ( ( ( esk1_0 @ esk3_0 @ esk5_0 )
= esk5_0 )
| ( ( esk1_0 @ esk6_0 @ ( esk2_0 @ esk7_0 @ ( esk1_0 @ esk6_0 @ esk8_0 ) ) )
!= ( esk2_0 @ ( esk1_0 @ esk6_0 @ esk7_0 ) @ ( esk1_0 @ esk6_0 @ esk8_0 ) ) ) )
& ( ( ( esk1_0 @ esk3_0 @ ( esk2_0 @ esk4_0 @ esk5_0 ) )
!= ( esk2_0 @ ( esk1_0 @ esk3_0 @ esk4_0 ) @ esk5_0 ) )
| ( ( esk1_0 @ esk6_0 @ ( esk2_0 @ esk7_0 @ ( esk1_0 @ esk6_0 @ esk8_0 ) ) )
!= ( esk2_0 @ ( esk1_0 @ esk6_0 @ esk7_0 ) @ ( esk1_0 @ esk6_0 @ esk8_0 ) ) ) )
& ( ( ( esk1_0 @ X54 @ X56 )
!= X56 )
| ( ( esk1_0 @ X54 @ ( esk2_0 @ X55 @ X56 ) )
= ( esk2_0 @ ( esk1_0 @ X54 @ X55 ) @ X56 ) )
| ( ( esk1_0 @ X57 @ ( esk2_0 @ X58 @ ( esk1_0 @ X57 @ X59 ) ) )
= ( esk2_0 @ ( esk1_0 @ X57 @ X58 ) @ ( esk1_0 @ X57 @ X59 ) ) ) ) ),
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_1])])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X3: a,X4: a,X5: a] :
( ( esk1_0 @ ( esk1_0 @ X3 @ X4 ) @ X5 )
= ( esk1_0 @ X3 @ ( esk1_0 @ X4 @ X5 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X3: a] :
( ( esk1_0 @ X3 @ X3 )
= X3 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X3: a,X4: a] :
( ( esk1_0 @ ( esk2_0 @ X3 @ X4 ) @ X4 )
= X4 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
! [X4: a,X3: a] :
( ( esk1_0 @ X3 @ X4 )
= ( esk1_0 @ X4 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X3: a,X4: a] :
( ( esk2_0 @ ( esk1_0 @ X3 @ X4 ) @ X4 )
= X4 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
! [X4: a,X3: a] :
( ( esk2_0 @ X3 @ X4 )
= ( esk2_0 @ X4 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_9,negated_conjecture,
! [X3: a,X8: a,X10: a,X9: a,X5: a,X4: a] :
( ( ( esk1_0 @ X3 @ ( esk2_0 @ X5 @ X4 ) )
= ( esk2_0 @ ( esk1_0 @ X3 @ X5 ) @ X4 ) )
| ( ( esk1_0 @ X8 @ ( esk2_0 @ X9 @ ( esk1_0 @ X8 @ X10 ) ) )
= ( esk2_0 @ ( esk1_0 @ X8 @ X9 ) @ ( esk1_0 @ X8 @ X10 ) ) )
| ( ( esk1_0 @ X3 @ X4 )
!= X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_10,negated_conjecture,
! [X3: a,X4: a] :
( ( esk1_0 @ X3 @ ( esk1_0 @ X3 @ X4 ) )
= ( esk1_0 @ X3 @ X4 ) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_11,negated_conjecture,
! [X4: a,X3: a] :
( ( esk1_0 @ X3 @ ( esk2_0 @ X4 @ X3 ) )
= X3 ),
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_12,negated_conjecture,
! [X4: a,X3: a] :
( ( esk2_0 @ X3 @ ( esk1_0 @ X4 @ X3 ) )
= X3 ),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_13,negated_conjecture,
( ( ( esk1_0 @ esk3_0 @ esk5_0 )
= esk5_0 )
| ( ( esk1_0 @ esk6_0 @ ( esk2_0 @ esk7_0 @ ( esk1_0 @ esk6_0 @ esk8_0 ) ) )
!= ( esk2_0 @ ( esk1_0 @ esk6_0 @ esk7_0 ) @ ( esk1_0 @ esk6_0 @ esk8_0 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_14,negated_conjecture,
! [X3: a,X4: a,X5: a,X8: a,X9: a,X10: a] :
( ( ( esk2_0 @ ( esk1_0 @ X3 @ X4 ) @ ( esk1_0 @ X3 @ X5 ) )
= ( esk1_0 @ X3 @ ( esk2_0 @ X4 @ ( esk1_0 @ X3 @ X5 ) ) ) )
| ( ( esk2_0 @ ( esk1_0 @ X8 @ X9 ) @ ( esk1_0 @ X8 @ X10 ) )
= ( esk1_0 @ X8 @ ( esk2_0 @ X9 @ ( esk1_0 @ X8 @ X10 ) ) ) ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_15,negated_conjecture,
! [X3: a,X4: a,X5: a] :
( ( esk2_0 @ ( esk2_0 @ X3 @ X4 ) @ X5 )
= ( esk2_0 @ X3 @ ( esk2_0 @ X4 @ X5 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_16,negated_conjecture,
! [X4: a,X3: a] :
( ( esk1_0 @ X3 @ ( esk2_0 @ X3 @ X4 ) )
= X3 ),
inference(spm,[status(thm)],[c_0_11,c_0_8]) ).
thf(c_0_17,negated_conjecture,
! [X5: a,X4: a,X3: a] :
( ( esk2_0 @ X3 @ ( esk1_0 @ X4 @ ( esk1_0 @ X5 @ X3 ) ) )
= X3 ),
inference(spm,[status(thm)],[c_0_12,c_0_3]) ).
thf(c_0_18,negated_conjecture,
( ( ( esk1_0 @ esk5_0 @ esk3_0 )
= esk5_0 )
| ( ( esk2_0 @ ( esk1_0 @ esk6_0 @ esk7_0 ) @ ( esk1_0 @ esk6_0 @ esk8_0 ) )
!= ( esk1_0 @ esk6_0 @ ( esk2_0 @ esk7_0 @ ( esk1_0 @ esk6_0 @ esk8_0 ) ) ) ) ),
inference(rw,[status(thm)],[c_0_13,c_0_6]) ).
thf(c_0_19,negated_conjecture,
! [X3: a,X4: a,X5: a] :
( ( esk2_0 @ ( esk1_0 @ X3 @ X4 ) @ ( esk1_0 @ X3 @ X5 ) )
= ( esk1_0 @ X3 @ ( esk2_0 @ X4 @ ( esk1_0 @ X3 @ X5 ) ) ) ),
inference(ef,[status(thm)],[c_0_14]) ).
thf(c_0_20,negated_conjecture,
! [X3: a,X5: a,X4: a] :
( ( esk2_0 @ X3 @ ( esk2_0 @ X4 @ X5 ) )
= ( esk2_0 @ X5 @ ( esk2_0 @ X3 @ X4 ) ) ),
inference(spm,[status(thm)],[c_0_8,c_0_15]) ).
thf(c_0_21,negated_conjecture,
! [X3: a,X4: a,X5: a] :
( ( esk1_0 @ X3 @ ( esk1_0 @ ( esk2_0 @ X4 @ X3 ) @ X5 ) )
= ( esk1_0 @ X3 @ X5 ) ),
inference(spm,[status(thm)],[c_0_3,c_0_11]) ).
thf(c_0_22,negated_conjecture,
! [X3: a,X5: a,X4: a] :
( ( esk1_0 @ ( esk2_0 @ X3 @ X4 ) @ ( esk2_0 @ X3 @ ( esk2_0 @ X4 @ X5 ) ) )
= ( esk2_0 @ X3 @ X4 ) ),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
thf(c_0_23,negated_conjecture,
! [X3: a,X4: a,X5: a] :
( ( esk2_0 @ X3 @ ( esk2_0 @ X4 @ X5 ) )
= ( esk2_0 @ X4 @ ( esk2_0 @ X3 @ X5 ) ) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_8]),c_0_15]) ).
thf(c_0_24,negated_conjecture,
! [X3: a,X5: a,X4: a] :
( ( esk2_0 @ X3 @ ( esk2_0 @ X4 @ ( esk1_0 @ X5 @ X3 ) ) )
= ( esk2_0 @ X3 @ X4 ) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_16]),c_0_15]) ).
thf(c_0_25,negated_conjecture,
( ( esk1_0 @ esk5_0 @ esk3_0 )
= esk5_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).
thf(c_0_26,negated_conjecture,
! [X5: a,X4: a,X3: a] :
( ( esk2_0 @ X3 @ ( esk2_0 @ X4 @ X5 ) )
= ( esk2_0 @ X5 @ ( esk2_0 @ X4 @ X3 ) ) ),
inference(spm,[status(thm)],[c_0_20,c_0_8]) ).
thf(c_0_27,negated_conjecture,
! [X3: a,X5: a,X4: a] :
( ( esk2_0 @ ( esk1_0 @ X3 @ X4 ) @ ( esk1_0 @ ( esk2_0 @ X5 @ X3 ) @ X4 ) )
= ( esk1_0 @ ( esk2_0 @ X5 @ X3 ) @ X4 ) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_21]),c_0_8]) ).
thf(c_0_28,negated_conjecture,
! [X3: a,X5: a,X4: a] :
( ( esk1_0 @ ( esk2_0 @ X3 @ X4 ) @ ( esk2_0 @ X4 @ ( esk2_0 @ X3 @ X5 ) ) )
= ( esk2_0 @ X3 @ X4 ) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
thf(c_0_29,negated_conjecture,
! [X3: a] :
( ( esk2_0 @ esk5_0 @ ( esk2_0 @ X3 @ esk3_0 ) )
= ( esk2_0 @ esk3_0 @ X3 ) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
thf(c_0_30,negated_conjecture,
( ( ( esk1_0 @ esk3_0 @ ( esk2_0 @ esk4_0 @ esk5_0 ) )
!= ( esk2_0 @ ( esk1_0 @ esk3_0 @ esk4_0 ) @ esk5_0 ) )
| ( ( esk1_0 @ esk6_0 @ ( esk2_0 @ esk7_0 @ ( esk1_0 @ esk6_0 @ esk8_0 ) ) )
!= ( esk2_0 @ ( esk1_0 @ esk6_0 @ esk7_0 ) @ ( esk1_0 @ esk6_0 @ esk8_0 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_31,negated_conjecture,
! [X3: a,X5: a,X4: a] :
( ( esk2_0 @ X3 @ ( esk2_0 @ X4 @ ( esk1_0 @ X5 @ ( esk2_0 @ X3 @ X4 ) ) ) )
= ( esk2_0 @ X3 @ X4 ) ),
inference(spm,[status(thm)],[c_0_15,c_0_12]) ).
thf(c_0_32,negated_conjecture,
! [X3: a] :
( ( esk2_0 @ esk5_0 @ ( esk1_0 @ esk3_0 @ ( esk2_0 @ X3 @ esk5_0 ) ) )
= ( esk1_0 @ esk3_0 @ ( esk2_0 @ X3 @ esk5_0 ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_25]),c_0_6]),c_0_6]) ).
thf(c_0_33,negated_conjecture,
! [X3: a] :
( ( esk1_0 @ ( esk2_0 @ X3 @ esk5_0 ) @ ( esk2_0 @ esk3_0 @ X3 ) )
= ( esk2_0 @ X3 @ esk5_0 ) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
thf(c_0_34,negated_conjecture,
! [X4: a,X3: a] :
( ( esk2_0 @ X3 @ ( esk1_0 @ X3 @ X4 ) )
= X3 ),
inference(spm,[status(thm)],[c_0_12,c_0_6]) ).
thf(c_0_35,negated_conjecture,
( ( ( esk2_0 @ ( esk1_0 @ esk6_0 @ esk7_0 ) @ ( esk1_0 @ esk6_0 @ esk8_0 ) )
!= ( esk1_0 @ esk6_0 @ ( esk2_0 @ esk7_0 @ ( esk1_0 @ esk6_0 @ esk8_0 ) ) ) )
| ( ( esk2_0 @ esk5_0 @ ( esk1_0 @ esk3_0 @ esk4_0 ) )
!= ( esk1_0 @ esk3_0 @ ( esk2_0 @ esk5_0 @ esk4_0 ) ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_8]),c_0_8]) ).
thf(c_0_36,negated_conjecture,
! [X3: a] :
( ( esk2_0 @ X3 @ ( esk1_0 @ esk3_0 @ ( esk2_0 @ X3 @ esk5_0 ) ) )
= ( esk2_0 @ X3 @ esk5_0 ) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
thf(c_0_37,negated_conjecture,
! [X3: a] :
( ( esk1_0 @ esk3_0 @ ( esk2_0 @ esk5_0 @ ( esk1_0 @ esk3_0 @ X3 ) ) )
= ( esk2_0 @ esk5_0 @ ( esk1_0 @ esk3_0 @ X3 ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_8]),c_0_6]),c_0_8]) ).
thf(c_0_38,negated_conjecture,
( ( esk2_0 @ esk5_0 @ ( esk1_0 @ esk3_0 @ esk4_0 ) )
!= ( esk1_0 @ esk3_0 @ ( esk2_0 @ esk5_0 @ esk4_0 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_19])]) ).
thf(c_0_39,negated_conjecture,
! [X3: a] :
( ( esk2_0 @ esk5_0 @ ( esk1_0 @ esk3_0 @ X3 ) )
= ( esk1_0 @ esk3_0 @ ( esk2_0 @ X3 @ esk5_0 ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_36]),c_0_8]),c_0_8]),c_0_37]),c_0_24]) ).
thf(c_0_40,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39]),c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEV000^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n009.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 : Sun May 19 18:44:52 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running higher-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/eprover-ho --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
% 1.42/0.70 # Version: 3.1.0-ho
% 1.42/0.70 # Preprocessing class: HSMSSMSSSSSNSSA.
% 1.42/0.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.42/0.70 # Starting post_as_ho1 with 1500s (5) cores
% 1.42/0.70 # Starting post_as_ho12 with 300s (1) cores
% 1.42/0.70 # Starting new_ho_3 with 300s (1) cores
% 1.42/0.70 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 1.42/0.70 # ehoh_best2_full_lfho with pid 3836 completed with status 0
% 1.42/0.70 # Result found by ehoh_best2_full_lfho
% 1.42/0.70 # Preprocessing class: HSMSSMSSSSSNSSA.
% 1.42/0.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.42/0.70 # Starting post_as_ho1 with 1500s (5) cores
% 1.42/0.70 # Starting post_as_ho12 with 300s (1) cores
% 1.42/0.70 # Starting new_ho_3 with 300s (1) cores
% 1.42/0.70 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 1.42/0.70 # No SInE strategy applied
% 1.42/0.70 # Search class: HGHPM-FFSF00-MSSFFFNN
% 1.42/0.70 # partial match(3): HGHNF-FFSF00-SSSFFFNN
% 1.42/0.70 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.42/0.70 # Starting sh3 with 163s (1) cores
% 1.42/0.70 # sh3 with pid 3841 completed with status 0
% 1.42/0.70 # Result found by sh3
% 1.42/0.70 # Preprocessing class: HSMSSMSSSSSNSSA.
% 1.42/0.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.42/0.70 # Starting post_as_ho1 with 1500s (5) cores
% 1.42/0.70 # Starting post_as_ho12 with 300s (1) cores
% 1.42/0.70 # Starting new_ho_3 with 300s (1) cores
% 1.42/0.70 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 1.42/0.70 # No SInE strategy applied
% 1.42/0.70 # Search class: HGHPM-FFSF00-MSSFFFNN
% 1.42/0.70 # partial match(3): HGHNF-FFSF00-SSSFFFNN
% 1.42/0.70 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.42/0.70 # Starting sh3 with 163s (1) cores
% 1.42/0.70 # Preprocessing time : 0.001 s
% 1.42/0.70 # Presaturation interreduction done
% 1.42/0.70
% 1.42/0.70 # Proof found!
% 1.42/0.70 # SZS status Theorem
% 1.42/0.70 # SZS output start CNFRefutation
% See solution above
% 1.42/0.70 # Parsed axioms : 2
% 1.42/0.70 # Removed by relevancy pruning/SinE : 0
% 1.42/0.70 # Initial clauses : 12
% 1.42/0.70 # Removed in clause preprocessing : 1
% 1.42/0.70 # Initial clauses in saturation : 11
% 1.42/0.70 # Processed clauses : 1597
% 1.42/0.70 # ...of these trivial : 500
% 1.42/0.70 # ...subsumed : 918
% 1.42/0.70 # ...remaining for further processing : 179
% 1.42/0.70 # Other redundant clauses eliminated : 0
% 1.42/0.70 # Clauses deleted for lack of memory : 0
% 1.42/0.70 # Backward-subsumed : 3
% 1.42/0.70 # Backward-rewritten : 22
% 1.42/0.70 # Generated clauses : 21265
% 1.42/0.70 # ...of the previous two non-redundant : 12689
% 1.42/0.70 # ...aggressively subsumed : 0
% 1.42/0.70 # Contextual simplify-reflections : 0
% 1.42/0.70 # Paramodulations : 21261
% 1.42/0.70 # Factorizations : 4
% 1.42/0.70 # NegExts : 0
% 1.42/0.70 # Equation resolutions : 0
% 1.42/0.70 # Disequality decompositions : 0
% 1.42/0.70 # Total rewrite steps : 29222
% 1.42/0.70 # ...of those cached : 21148
% 1.42/0.70 # Propositional unsat checks : 0
% 1.42/0.70 # Propositional check models : 0
% 1.42/0.70 # Propositional check unsatisfiable : 0
% 1.42/0.70 # Propositional clauses : 0
% 1.42/0.70 # Propositional clauses after purity: 0
% 1.42/0.70 # Propositional unsat core size : 0
% 1.42/0.70 # Propositional preprocessing time : 0.000
% 1.42/0.70 # Propositional encoding time : 0.000
% 1.42/0.70 # Propositional solver time : 0.000
% 1.42/0.70 # Success case prop preproc time : 0.000
% 1.42/0.70 # Success case prop encoding time : 0.000
% 1.42/0.70 # Success case prop solver time : 0.000
% 1.42/0.70 # Current number of processed clauses : 143
% 1.42/0.70 # Positive orientable unit clauses : 135
% 1.42/0.70 # Positive unorientable unit clauses: 8
% 1.42/0.70 # Negative unit clauses : 0
% 1.42/0.70 # Non-unit-clauses : 0
% 1.42/0.70 # Current number of unprocessed clauses: 11111
% 1.42/0.70 # ...number of literals in the above : 12603
% 1.42/0.70 # Current number of archived formulas : 0
% 1.42/0.70 # Current number of archived clauses : 36
% 1.42/0.70 # Clause-clause subsumption calls (NU) : 48
% 1.42/0.70 # Rec. Clause-clause subsumption calls : 47
% 1.42/0.70 # Non-unit clause-clause subsumptions : 3
% 1.42/0.70 # Unit Clause-clause subsumption calls : 354
% 1.42/0.70 # Rewrite failures with RHS unbound : 0
% 1.42/0.70 # BW rewrite match attempts : 523
% 1.42/0.70 # BW rewrite match successes : 166
% 1.42/0.70 # Condensation attempts : 0
% 1.42/0.70 # Condensation successes : 0
% 1.42/0.70 # Termbank termtop insertions : 232559
% 1.42/0.70 # Search garbage collected termcells : 525
% 1.42/0.70
% 1.42/0.70 # -------------------------------------------------
% 1.42/0.70 # User time : 0.206 s
% 1.42/0.70 # System time : 0.009 s
% 1.42/0.70 # Total time : 0.215 s
% 1.42/0.70 # Maximum resident set size: 1708 pages
% 1.42/0.70
% 1.42/0.70 # -------------------------------------------------
% 1.42/0.70 # User time : 0.206 s
% 1.42/0.70 # System time : 0.012 s
% 1.42/0.70 # Total time : 0.219 s
% 1.42/0.70 # Maximum resident set size: 1720 pages
% 1.42/0.70 % E---3.1 exiting
% 1.42/0.70 % E exiting
%------------------------------------------------------------------------------