TSTP Solution File: LCL898+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL898+1 : TPTP v8.1.2. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:23:04 EDT 2023
% Result : Theorem 3.64s 0.89s
% Output : CNFRefutation 3.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 13
% Syntax : Number of formulae : 86 ( 72 unt; 0 def)
% Number of atoms : 105 ( 49 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 35 ( 16 ~; 13 |; 2 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 166 ( 8 sgn; 50 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(sos_14,axiom,
! [X1] : '+'(X1,'1') = '1',
file('/export/starexec/sandbox2/tmp/tmp.enlRs3eASV/E---3.1_27953.p',sos_14) ).
fof(sos_02,axiom,
! [X1,X2] : '+'(X1,X2) = '+'(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.enlRs3eASV/E---3.1_27953.p',sos_02) ).
fof(sos_12,axiom,
! [X1,X2] : '+'(X1,'==>'(X1,X2)) = '+'(X2,'==>'(X2,X1)),
file('/export/starexec/sandbox2/tmp/tmp.enlRs3eASV/E---3.1_27953.p',sos_12) ).
fof(sos_07,axiom,
! [X9,X10,X11] :
( '>='('+'(X9,X10),X11)
<=> '>='(X10,'==>'(X9,X11)) ),
file('/export/starexec/sandbox2/tmp/tmp.enlRs3eASV/E---3.1_27953.p',sos_07) ).
fof(sos_04,axiom,
! [X1] : '>='(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.enlRs3eASV/E---3.1_27953.p',sos_04) ).
fof(sos_01,axiom,
! [X1,X2,X3] : '+'('+'(X1,X2),X3) = '+'(X1,'+'(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.enlRs3eASV/E---3.1_27953.p',sos_01) ).
fof(sos_03,axiom,
! [X1] : '+'(X1,'0') = X1,
file('/export/starexec/sandbox2/tmp/tmp.enlRs3eASV/E---3.1_27953.p',sos_03) ).
fof(sos_13,axiom,
! [X1] : '==>'('==>'(X1,'1'),'1') = X1,
file('/export/starexec/sandbox2/tmp/tmp.enlRs3eASV/E---3.1_27953.p',sos_13) ).
fof(sos_06,axiom,
! [X7,X8] :
( ( '>='(X7,X8)
& '>='(X8,X7) )
=> X7 = X8 ),
file('/export/starexec/sandbox2/tmp/tmp.enlRs3eASV/E---3.1_27953.p',sos_06) ).
fof(sos_08,axiom,
! [X1] : '>='(X1,'0'),
file('/export/starexec/sandbox2/tmp/tmp.enlRs3eASV/E---3.1_27953.p',sos_08) ).
fof(sos_09,axiom,
! [X12,X13,X14] :
( '>='(X12,X13)
=> '>='('+'(X12,X14),'+'(X13,X14)) ),
file('/export/starexec/sandbox2/tmp/tmp.enlRs3eASV/E---3.1_27953.p',sos_09) ).
fof(sos_11,axiom,
! [X18,X19,X20] :
( '>='(X18,X19)
=> '>='('==>'(X20,X18),'==>'(X20,X19)) ),
file('/export/starexec/sandbox2/tmp/tmp.enlRs3eASV/E---3.1_27953.p',sos_11) ).
fof(goals_15,conjecture,
! [X21,X22] : '==>'('==>'(X21,X22),X22) = '==>'('==>'(X22,X21),X21),
file('/export/starexec/sandbox2/tmp/tmp.enlRs3eASV/E---3.1_27953.p',goals_15) ).
fof(c_0_13,plain,
! [X53] : '+'(X53,'1') = '1',
inference(variable_rename,[status(thm)],[sos_14]) ).
fof(c_0_14,plain,
! [X50,X51] : '+'(X50,X51) = '+'(X51,X50),
inference(variable_rename,[status(thm)],[sos_02]) ).
cnf(c_0_15,plain,
'+'(X1,'1') = '1',
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
'+'(X1,X2) = '+'(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X34,X35] : '+'(X34,'==>'(X34,X35)) = '+'(X35,'==>'(X35,X34)),
inference(variable_rename,[status(thm)],[sos_12]) ).
fof(c_0_18,plain,
! [X25,X26,X27] :
( ( ~ '>='('+'(X25,X26),X27)
| '>='(X26,'==>'(X25,X27)) )
& ( ~ '>='(X26,'==>'(X25,X27))
| '>='('+'(X25,X26),X27) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_07])]) ).
fof(c_0_19,plain,
! [X37] : '>='(X37,X37),
inference(variable_rename,[status(thm)],[sos_04]) ).
fof(c_0_20,plain,
! [X47,X48,X49] : '+'('+'(X47,X48),X49) = '+'(X47,'+'(X48,X49)),
inference(variable_rename,[status(thm)],[sos_01]) ).
cnf(c_0_21,plain,
'+'('1',X1) = '1',
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
'+'(X1,'==>'(X1,X2)) = '+'(X2,'==>'(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
( '>='(X2,'==>'(X1,X3))
| ~ '>='('+'(X1,X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
'>='(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
'+'('+'(X1,X2),X3) = '+'(X1,'+'(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
'+'(X1,'==>'(X1,'1')) = '1',
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
fof(c_0_27,plain,
! [X52] : '+'(X52,'0') = X52,
inference(variable_rename,[status(thm)],[sos_03]) ).
cnf(c_0_28,plain,
'>='(X1,'==>'(X2,'+'(X2,X1))),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
'+'(X1,'+'('==>'(X1,'1'),X2)) = '1',
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_21]) ).
cnf(c_0_30,plain,
'+'(X1,'0') = X1,
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_31,plain,
( '>='('+'(X2,X1),X3)
| ~ '>='(X1,'==>'(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_32,plain,
'>='(X1,'==>'(X2,'+'(X1,X2))),
inference(spm,[status(thm)],[c_0_28,c_0_16]) ).
cnf(c_0_33,plain,
'+'(X1,'+'(X2,X3)) = '+'(X2,'+'(X3,X1)),
inference(spm,[status(thm)],[c_0_25,c_0_16]) ).
cnf(c_0_34,plain,
'+'(X1,'+'(X2,'==>'(X2,'==>'(X1,'1')))) = '1',
inference(spm,[status(thm)],[c_0_29,c_0_22]) ).
fof(c_0_35,plain,
! [X36] : '==>'('==>'(X36,'1'),'1') = X36,
inference(variable_rename,[status(thm)],[sos_13]) ).
fof(c_0_36,plain,
! [X41,X42] :
( ~ '>='(X41,X42)
| ~ '>='(X42,X41)
| X41 = X42 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_06])]) ).
cnf(c_0_37,plain,
( '>='('0','==>'(X1,X2))
| ~ '>='(X1,X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_30]) ).
cnf(c_0_38,plain,
'>='('+'(X1,X2),'+'(X2,X1)),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
fof(c_0_39,plain,
! [X43] : '>='(X43,'0'),
inference(variable_rename,[status(thm)],[sos_08]) ).
cnf(c_0_40,plain,
'+'(X1,'+'(X2,'==>'(X1,'==>'(X2,'1')))) = '1',
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_16]) ).
cnf(c_0_41,plain,
'==>'('==>'(X1,'1'),'1') = X1,
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_42,plain,
( X1 = X2
| ~ '>='(X1,X2)
| ~ '>='(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_43,plain,
'>='('0','==>'('+'(X1,X2),'+'(X2,X1))),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,plain,
'>='(X1,'0'),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_45,plain,
'>='('+'(X1,'==>'(X2,'==>'(X1,'1'))),'==>'(X2,'1')),
inference(spm,[status(thm)],[c_0_28,c_0_40]) ).
cnf(c_0_46,plain,
'+'('==>'(X1,'1'),'+'(X2,'==>'(X2,X1))) = '1',
inference(spm,[status(thm)],[c_0_34,c_0_41]) ).
cnf(c_0_47,plain,
'==>'('+'(X1,X2),'+'(X2,X1)) = '0',
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]) ).
cnf(c_0_48,plain,
'>='('==>'(X1,'==>'(X2,'1')),'==>'(X2,'==>'(X1,'1'))),
inference(spm,[status(thm)],[c_0_23,c_0_45]) ).
cnf(c_0_49,plain,
'+'(X1,'+'(X2,'==>'('+'(X2,X1),'1'))) = '1',
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_30]),c_0_16]),c_0_25]) ).
cnf(c_0_50,plain,
'==>'(X1,'==>'(X2,'1')) = '==>'(X2,'==>'(X1,'1')),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_48]),c_0_48])]) ).
fof(c_0_51,plain,
! [X44,X45,X46] :
( ~ '>='(X44,X45)
| '>='('+'(X44,X46),'+'(X45,X46)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_09])]) ).
cnf(c_0_52,plain,
'>='('+'(X1,'==>'('+'(X1,X2),'1')),'==>'(X2,'1')),
inference(spm,[status(thm)],[c_0_28,c_0_49]) ).
cnf(c_0_53,plain,
'==>'('==>'(X1,'1'),'==>'(X2,'1')) = '==>'(X2,X1),
inference(spm,[status(thm)],[c_0_50,c_0_41]) ).
cnf(c_0_54,plain,
'+'(X1,'+'(X2,'==>'(X1,'1'))) = '1',
inference(spm,[status(thm)],[c_0_29,c_0_16]) ).
cnf(c_0_55,plain,
'+'(X1,'+'('==>'(X1,X2),X3)) = '+'(X2,'+'('==>'(X2,X1),X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_22]),c_0_25]) ).
cnf(c_0_56,plain,
( '>='('+'(X1,X3),'+'(X2,X3))
| ~ '>='(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_57,plain,
'+'('0',X1) = X1,
inference(spm,[status(thm)],[c_0_30,c_0_16]) ).
cnf(c_0_58,plain,
'>='(X1,'==>'('+'(X2,X3),'+'(X2,'+'(X3,X1)))),
inference(spm,[status(thm)],[c_0_28,c_0_25]) ).
cnf(c_0_59,plain,
'>='('==>'('+'(X1,X2),'1'),'==>'(X1,'==>'(X2,'1'))),
inference(spm,[status(thm)],[c_0_23,c_0_52]) ).
cnf(c_0_60,plain,
'==>'('==>'(X1,'1'),X2) = '==>'('==>'(X2,'1'),X1),
inference(spm,[status(thm)],[c_0_53,c_0_41]) ).
cnf(c_0_61,plain,
'+'(X1,'+'('==>'(X1,X2),'==>'(X2,'1'))) = '1',
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
fof(c_0_62,plain,
! [X31,X32,X33] :
( ~ '>='(X31,X32)
| '>='('==>'(X33,X31),'==>'(X33,X32)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_11])]) ).
cnf(c_0_63,plain,
'>='('+'(X1,X2),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_44]),c_0_57]) ).
cnf(c_0_64,plain,
'>='('==>'(X1,X2),'==>'('+'('==>'(X2,'1'),X1),'1')),
inference(spm,[status(thm)],[c_0_58,c_0_46]) ).
cnf(c_0_65,plain,
'>='('==>'('+'('==>'(X1,'1'),X2),'1'),'==>'(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_41]) ).
cnf(c_0_66,plain,
'>='('+'('==>'(X1,X2),'==>'(X2,'1')),'==>'(X1,'1')),
inference(spm,[status(thm)],[c_0_28,c_0_61]) ).
cnf(c_0_67,plain,
( '>='('==>'(X3,X1),'==>'(X3,X2))
| ~ '>='(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_68,plain,
'>='('+'(X1,X2),X1),
inference(spm,[status(thm)],[c_0_63,c_0_16]) ).
cnf(c_0_69,plain,
'==>'('+'('==>'(X1,'1'),X2),'1') = '==>'(X2,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_64]),c_0_65])]) ).
cnf(c_0_70,plain,
'>='('==>'(X1,'1'),'==>'(X2,'==>'('==>'(X2,X1),'1'))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_66]),c_0_50]) ).
cnf(c_0_71,plain,
'>='('==>'(X1,X2),'==>'(X1,'+'(X2,'==>'(X2,X1)))),
inference(spm,[status(thm)],[c_0_28,c_0_22]) ).
cnf(c_0_72,plain,
'>='('==>'(X1,'+'(X2,X3)),'==>'(X1,X2)),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_73,plain,
'==>'('==>'(X1,X2),'1') = '+'('==>'(X2,'1'),X1),
inference(spm,[status(thm)],[c_0_41,c_0_69]) ).
cnf(c_0_74,plain,
'>='(X1,'==>'('==>'(X1,X2),X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_53]),c_0_41]),c_0_53]) ).
cnf(c_0_75,plain,
'==>'(X1,'+'(X2,'==>'(X2,X1))) = '==>'(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_71]),c_0_72])]) ).
cnf(c_0_76,plain,
'==>'('==>'(X1,'1'),'+'('==>'(X2,'1'),X3)) = '==>'('==>'(X3,X2),X1),
inference(spm,[status(thm)],[c_0_53,c_0_73]) ).
cnf(c_0_77,plain,
'>='('0','==>'(X1,'==>'('==>'(X1,X2),X2))),
inference(spm,[status(thm)],[c_0_37,c_0_74]) ).
fof(c_0_78,negated_conjecture,
~ ! [X21,X22] : '==>'('==>'(X21,X22),X22) = '==>'('==>'(X22,X21),X21),
inference(assume_negation,[status(cth)],[goals_15]) ).
cnf(c_0_79,plain,
'==>'('==>'('==>'(X1,X2),X2),X1) = '==>'(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_53]),c_0_53]) ).
cnf(c_0_80,plain,
'==>'(X1,'==>'('==>'(X1,X2),X2)) = '0',
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_77]),c_0_44])]) ).
fof(c_0_81,negated_conjecture,
'==>'('==>'(esk1_0,esk2_0),esk2_0) != '==>'('==>'(esk2_0,esk1_0),esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_78])])]) ).
cnf(c_0_82,plain,
'+'('==>'(X1,X2),'==>'('==>'(X2,X1),X1)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_79]),c_0_80]),c_0_30]),c_0_16]) ).
cnf(c_0_83,negated_conjecture,
'==>'('==>'(esk1_0,esk2_0),esk2_0) != '==>'('==>'(esk2_0,esk1_0),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_81]) ).
cnf(c_0_84,plain,
'==>'('==>'(X1,X2),X2) = '==>'('==>'(X2,X1),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_79]),c_0_80]),c_0_57]) ).
cnf(c_0_85,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_84])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : LCL898+1 : TPTP v8.1.2. Released v5.5.0.
% 0.05/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n002.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 12:05:59 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.enlRs3eASV/E---3.1_27953.p
% 3.64/0.89 # Version: 3.1pre001
% 3.64/0.89 # Preprocessing class: FSMSSMSSSSSNFFN.
% 3.64/0.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.64/0.89 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.64/0.89 # Starting new_bool_3 with 300s (1) cores
% 3.64/0.89 # Starting new_bool_1 with 300s (1) cores
% 3.64/0.89 # Starting sh5l with 300s (1) cores
% 3.64/0.89 # sh5l with pid 28034 completed with status 0
% 3.64/0.89 # Result found by sh5l
% 3.64/0.89 # Preprocessing class: FSMSSMSSSSSNFFN.
% 3.64/0.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.64/0.89 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.64/0.89 # Starting new_bool_3 with 300s (1) cores
% 3.64/0.89 # Starting new_bool_1 with 300s (1) cores
% 3.64/0.89 # Starting sh5l with 300s (1) cores
% 3.64/0.89 # SinE strategy is gf500_gu_R04_F100_L20000
% 3.64/0.89 # Search class: FHUSM-FFSF22-SFFFFFNN
% 3.64/0.89 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 3.64/0.89 # Starting G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 3.64/0.89 # G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with pid 28040 completed with status 0
% 3.64/0.89 # Result found by G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S
% 3.64/0.89 # Preprocessing class: FSMSSMSSSSSNFFN.
% 3.64/0.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.64/0.89 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.64/0.89 # Starting new_bool_3 with 300s (1) cores
% 3.64/0.89 # Starting new_bool_1 with 300s (1) cores
% 3.64/0.89 # Starting sh5l with 300s (1) cores
% 3.64/0.89 # SinE strategy is gf500_gu_R04_F100_L20000
% 3.64/0.89 # Search class: FHUSM-FFSF22-SFFFFFNN
% 3.64/0.89 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 3.64/0.89 # Starting G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 3.64/0.89 # Preprocessing time : 0.001 s
% 3.64/0.89 # Presaturation interreduction done
% 3.64/0.89
% 3.64/0.89 # Proof found!
% 3.64/0.89 # SZS status Theorem
% 3.64/0.89 # SZS output start CNFRefutation
% See solution above
% 3.64/0.89 # Parsed axioms : 15
% 3.64/0.89 # Removed by relevancy pruning/SinE : 0
% 3.64/0.89 # Initial clauses : 16
% 3.64/0.89 # Removed in clause preprocessing : 0
% 3.64/0.89 # Initial clauses in saturation : 16
% 3.64/0.89 # Processed clauses : 2480
% 3.64/0.89 # ...of these trivial : 1290
% 3.64/0.89 # ...subsumed : 678
% 3.64/0.89 # ...remaining for further processing : 512
% 3.64/0.89 # Other redundant clauses eliminated : 0
% 3.64/0.89 # Clauses deleted for lack of memory : 0
% 3.64/0.89 # Backward-subsumed : 1
% 3.64/0.89 # Backward-rewritten : 178
% 3.64/0.89 # Generated clauses : 61163
% 3.64/0.89 # ...of the previous two non-redundant : 26285
% 3.64/0.89 # ...aggressively subsumed : 0
% 3.64/0.89 # Contextual simplify-reflections : 0
% 3.64/0.89 # Paramodulations : 61163
% 3.64/0.89 # Factorizations : 0
% 3.64/0.89 # NegExts : 0
% 3.64/0.89 # Equation resolutions : 0
% 3.64/0.89 # Total rewrite steps : 95596
% 3.64/0.89 # Propositional unsat checks : 0
% 3.64/0.89 # Propositional check models : 0
% 3.64/0.89 # Propositional check unsatisfiable : 0
% 3.64/0.89 # Propositional clauses : 0
% 3.64/0.89 # Propositional clauses after purity: 0
% 3.64/0.89 # Propositional unsat core size : 0
% 3.64/0.89 # Propositional preprocessing time : 0.000
% 3.64/0.89 # Propositional encoding time : 0.000
% 3.64/0.89 # Propositional solver time : 0.000
% 3.64/0.89 # Success case prop preproc time : 0.000
% 3.64/0.89 # Success case prop encoding time : 0.000
% 3.64/0.89 # Success case prop solver time : 0.000
% 3.64/0.89 # Current number of processed clauses : 317
% 3.64/0.89 # Positive orientable unit clauses : 270
% 3.64/0.89 # Positive unorientable unit clauses: 10
% 3.64/0.89 # Negative unit clauses : 0
% 3.64/0.89 # Non-unit-clauses : 37
% 3.64/0.89 # Current number of unprocessed clauses: 23134
% 3.64/0.89 # ...number of literals in the above : 24614
% 3.64/0.89 # Current number of archived formulas : 0
% 3.64/0.89 # Current number of archived clauses : 195
% 3.64/0.89 # Clause-clause subsumption calls (NU) : 1069
% 3.64/0.89 # Rec. Clause-clause subsumption calls : 1069
% 3.64/0.89 # Non-unit clause-clause subsumptions : 543
% 3.64/0.89 # Unit Clause-clause subsumption calls : 107
% 3.64/0.89 # Rewrite failures with RHS unbound : 0
% 3.64/0.89 # BW rewrite match attempts : 2742
% 3.64/0.89 # BW rewrite match successes : 401
% 3.64/0.89 # Condensation attempts : 0
% 3.64/0.89 # Condensation successes : 0
% 3.64/0.89 # Termbank termtop insertions : 574607
% 3.64/0.89
% 3.64/0.89 # -------------------------------------------------
% 3.64/0.89 # User time : 0.415 s
% 3.64/0.89 # System time : 0.017 s
% 3.64/0.89 # Total time : 0.433 s
% 3.64/0.89 # Maximum resident set size: 1760 pages
% 3.64/0.89
% 3.64/0.89 # -------------------------------------------------
% 3.64/0.89 # User time : 0.416 s
% 3.64/0.89 # System time : 0.019 s
% 3.64/0.89 # Total time : 0.435 s
% 3.64/0.89 # Maximum resident set size: 1700 pages
% 3.64/0.89 % E---3.1 exiting
% 3.64/0.89 % E---3.1 exiting
%------------------------------------------------------------------------------