TSTP Solution File: SYN415+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SYN415+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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 20:30:15 EDT 2023
% Result : Theorem 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 37
% Number of leaves : 1
% Syntax : Number of formulae : 83 ( 6 unt; 0 def)
% Number of atoms : 265 ( 96 equ)
% Maximal formula atoms : 38 ( 3 avg)
% Number of connectives : 285 ( 103 ~; 161 |; 15 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 75 ( 22 sgn; 11 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kalish317,conjecture,
( ( ? [X1] : f(X1)
& ! [X2,X3] :
( ( f(X2)
& f(X3) )
=> X2 = X3 ) )
<=> ? [X4] :
( f(X4)
& ! [X5] :
( f(X5)
=> X4 = X5 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.iLFGRNXPxY/E---3.1_11012.p',kalish317) ).
fof(c_0_1,negated_conjecture,
~ ( ( ? [X1] : f(X1)
& ! [X2,X3] :
( ( f(X2)
& f(X3) )
=> X2 = X3 ) )
<=> ? [X4] :
( f(X4)
& ! [X5] :
( f(X5)
=> X4 = X5 ) ) ),
inference(assume_negation,[status(cth)],[kalish317]) ).
fof(c_0_2,negated_conjecture,
! [X6,X9,X12,X13,X15] :
( ( f(esk3_1(X9))
| ~ f(X9)
| f(esk1_0)
| ~ f(X6) )
& ( X9 != esk3_1(X9)
| ~ f(X9)
| f(esk1_0)
| ~ f(X6) )
& ( f(esk3_1(X9))
| ~ f(X9)
| f(esk2_0)
| ~ f(X6) )
& ( X9 != esk3_1(X9)
| ~ f(X9)
| f(esk2_0)
| ~ f(X6) )
& ( f(esk3_1(X9))
| ~ f(X9)
| esk1_0 != esk2_0
| ~ f(X6) )
& ( X9 != esk3_1(X9)
| ~ f(X9)
| esk1_0 != esk2_0
| ~ f(X6) )
& ( f(esk5_0)
| f(esk4_0) )
& ( ~ f(X15)
| esk5_0 = X15
| f(esk4_0) )
& ( f(esk5_0)
| ~ f(X12)
| ~ f(X13)
| X12 = X13 )
& ( ~ f(X15)
| esk5_0 = X15
| ~ f(X12)
| ~ f(X13)
| X12 = X13 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).
cnf(c_0_3,negated_conjecture,
( f(esk3_1(X1))
| f(esk1_0)
| ~ f(X1)
| ~ f(X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( f(esk5_0)
| f(esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( f(esk5_0)
| X1 = X2
| ~ f(X1)
| ~ f(X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( f(esk3_1(X1))
| f(esk1_0)
| ~ f(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_3]) ).
cnf(c_0_7,negated_conjecture,
( X1 = esk4_0
| f(esk5_0)
| ~ f(X1) ),
inference(spm,[status(thm)],[c_0_5,c_0_4]) ).
cnf(c_0_8,negated_conjecture,
( f(esk3_1(esk4_0))
| f(esk5_0)
| f(esk1_0) ),
inference(spm,[status(thm)],[c_0_6,c_0_4]) ).
cnf(c_0_9,negated_conjecture,
( f(esk1_0)
| X1 != esk3_1(X1)
| ~ f(X1)
| ~ f(X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
( esk3_1(esk4_0) = esk4_0
| f(esk1_0)
| f(esk5_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( f(esk5_0)
| f(esk1_0)
| ~ f(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_4]) ).
cnf(c_0_12,negated_conjecture,
( esk5_0 = X1
| X2 = X3
| ~ f(X1)
| ~ f(X2)
| ~ f(X3) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_13,negated_conjecture,
( f(esk1_0)
| f(esk5_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_4]) ).
cnf(c_0_14,negated_conjecture,
( f(esk3_1(X1))
| f(esk2_0)
| ~ f(X1)
| ~ f(X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_15,negated_conjecture,
( X1 = X2
| esk5_0 != X2
| ~ f(X2)
| ~ f(X1) ),
inference(ef,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( esk4_0 = esk1_0
| f(esk5_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
( f(esk3_1(X1))
| f(esk2_0)
| ~ f(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_4]),c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( esk4_0 = esk1_0
| X1 = esk5_0
| ~ f(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
( esk4_0 = esk1_0
| f(esk3_1(esk5_0))
| f(esk1_0) ),
inference(spm,[status(thm)],[c_0_6,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
( f(esk3_1(esk4_0))
| f(esk5_0)
| f(esk2_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_4]) ).
cnf(c_0_21,negated_conjecture,
( esk3_1(esk5_0) = esk5_0
| esk4_0 = esk1_0
| f(esk1_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
( f(esk2_0)
| X1 != esk3_1(X1)
| ~ f(X1)
| ~ f(X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_23,negated_conjecture,
( esk3_1(esk4_0) = esk4_0
| f(esk2_0)
| f(esk5_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( esk4_0 = esk1_0
| f(esk1_0)
| ~ f(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_21]),c_0_13]) ).
cnf(c_0_25,negated_conjecture,
( f(esk5_0)
| f(esk2_0)
| ~ f(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_4]) ).
cnf(c_0_26,negated_conjecture,
( esk4_0 = esk1_0
| f(esk1_0) ),
inference(spm,[status(thm)],[c_0_24,c_0_16]) ).
cnf(c_0_27,negated_conjecture,
( esk5_0 = X1
| X2 != esk5_0
| ~ f(X2)
| ~ f(X1) ),
inference(ef,[status(thm)],[c_0_12]) ).
cnf(c_0_28,negated_conjecture,
( esk5_0 = X1
| ~ f(esk5_0)
| ~ f(X1) ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_12])]) ).
cnf(c_0_29,negated_conjecture,
( f(esk2_0)
| f(esk5_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_4]) ).
cnf(c_0_30,negated_conjecture,
( esk5_0 = X1
| f(esk4_0)
| ~ f(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_31,negated_conjecture,
( esk1_0 = esk5_0
| esk4_0 = esk1_0 ),
inference(spm,[status(thm)],[c_0_18,c_0_26]) ).
cnf(c_0_32,negated_conjecture,
( esk5_0 = X1
| esk1_0 != esk5_0
| ~ f(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_13]),c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( esk4_0 = esk2_0
| f(esk5_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
( X1 = esk1_0
| f(esk5_0)
| ~ f(X1) ),
inference(spm,[status(thm)],[c_0_5,c_0_13]) ).
cnf(c_0_35,negated_conjecture,
( esk5_0 = X1
| f(esk1_0)
| ~ f(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_36,negated_conjecture,
( esk4_0 = esk2_0
| f(esk3_1(esk5_0))
| f(esk1_0) ),
inference(spm,[status(thm)],[c_0_6,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
( esk2_0 = esk1_0
| f(esk5_0) ),
inference(spm,[status(thm)],[c_0_34,c_0_29]) ).
cnf(c_0_38,negated_conjecture,
( esk3_1(esk5_0) = esk5_0
| esk4_0 = esk2_0
| f(esk1_0) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,negated_conjecture,
( esk2_0 = esk1_0
| f(esk3_1(esk5_0))
| f(esk1_0) ),
inference(spm,[status(thm)],[c_0_6,c_0_37]) ).
cnf(c_0_40,negated_conjecture,
( esk4_0 = esk2_0
| f(esk1_0)
| ~ f(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_38]),c_0_13]) ).
cnf(c_0_41,negated_conjecture,
( esk3_1(esk5_0) = esk5_0
| esk2_0 = esk1_0
| f(esk1_0) ),
inference(spm,[status(thm)],[c_0_35,c_0_39]) ).
cnf(c_0_42,negated_conjecture,
( esk4_0 = esk2_0
| X1 = esk5_0
| ~ f(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_33]) ).
cnf(c_0_43,negated_conjecture,
( esk4_0 = esk2_0
| f(esk1_0) ),
inference(spm,[status(thm)],[c_0_40,c_0_33]) ).
cnf(c_0_44,negated_conjecture,
( esk2_0 = esk1_0
| f(esk1_0)
| ~ f(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_41]),c_0_13]) ).
cnf(c_0_45,negated_conjecture,
( esk1_0 = esk5_0
| esk4_0 = esk2_0 ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
( esk2_0 = esk1_0
| f(esk1_0) ),
inference(spm,[status(thm)],[c_0_44,c_0_37]) ).
cnf(c_0_47,negated_conjecture,
( esk2_0 = esk1_0
| esk1_0 = esk5_0 ),
inference(spm,[status(thm)],[c_0_31,c_0_45]) ).
cnf(c_0_48,negated_conjecture,
( esk2_0 = esk1_0
| X1 = esk1_0
| ~ f(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_46]),c_0_47]) ).
cnf(c_0_49,negated_conjecture,
( esk2_0 = esk1_0
| ~ f(esk2_0) ),
inference(ef,[status(thm)],[c_0_48]) ).
cnf(c_0_50,negated_conjecture,
( esk2_0 = esk1_0
| X1 = esk5_0
| ~ f(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_37]) ).
cnf(c_0_51,negated_conjecture,
( esk2_0 = esk1_0
| f(esk3_1(esk1_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_46]),c_0_49]) ).
cnf(c_0_52,negated_conjecture,
( esk3_1(esk1_0) = esk5_0
| esk2_0 = esk1_0 ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_53,negated_conjecture,
( esk2_0 = esk1_0
| ~ f(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_52]),c_0_46]),c_0_47]),c_0_49]) ).
cnf(c_0_54,negated_conjecture,
( f(esk3_1(X1))
| ~ f(X1)
| esk1_0 != esk2_0
| ~ f(X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_55,negated_conjecture,
esk2_0 = esk1_0,
inference(spm,[status(thm)],[c_0_53,c_0_37]) ).
cnf(c_0_56,negated_conjecture,
( f(esk3_1(X1))
| ~ f(X2)
| ~ f(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55])]) ).
cnf(c_0_57,negated_conjecture,
( f(esk3_1(X1))
| ~ f(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_4]),c_0_56]) ).
cnf(c_0_58,negated_conjecture,
( esk4_0 = esk1_0
| X1 = esk1_0
| ~ f(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_26]),c_0_31]) ).
cnf(c_0_59,negated_conjecture,
( X1 != esk3_1(X1)
| ~ f(X1)
| esk1_0 != esk2_0
| ~ f(X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_60,negated_conjecture,
( esk3_1(X1) = esk5_0
| f(esk4_0)
| ~ f(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_57]) ).
cnf(c_0_61,negated_conjecture,
( esk4_0 = esk1_0
| ~ f(esk4_0) ),
inference(ef,[status(thm)],[c_0_58]) ).
cnf(c_0_62,negated_conjecture,
( esk3_1(X1) != X1
| ~ f(X2)
| ~ f(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_55])]) ).
cnf(c_0_63,negated_conjecture,
( esk3_1(esk5_0) = esk5_0
| esk4_0 = esk1_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_16]),c_0_61]) ).
cnf(c_0_64,negated_conjecture,
( esk3_1(X1) = esk1_0
| f(esk5_0)
| ~ f(X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_57]) ).
cnf(c_0_65,negated_conjecture,
( esk4_0 = esk1_0
| ~ f(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_16]) ).
cnf(c_0_66,negated_conjecture,
( esk3_1(esk1_0) = esk1_0
| f(esk5_0) ),
inference(spm,[status(thm)],[c_0_64,c_0_13]) ).
cnf(c_0_67,negated_conjecture,
( esk5_0 = X1
| esk4_0 != esk5_0
| ~ f(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_4]),c_0_28]) ).
cnf(c_0_68,negated_conjecture,
esk4_0 = esk1_0,
inference(spm,[status(thm)],[c_0_65,c_0_16]) ).
cnf(c_0_69,negated_conjecture,
( f(esk5_0)
| ~ f(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_66]),c_0_13]) ).
cnf(c_0_70,negated_conjecture,
( esk3_1(X1) = esk5_0
| esk4_0 != esk5_0
| ~ f(X1) ),
inference(spm,[status(thm)],[c_0_67,c_0_57]) ).
cnf(c_0_71,negated_conjecture,
( esk3_1(X1) = esk5_0
| f(esk1_0)
| ~ f(X1) ),
inference(rw,[status(thm)],[c_0_60,c_0_68]) ).
cnf(c_0_72,negated_conjecture,
f(esk5_0),
inference(spm,[status(thm)],[c_0_69,c_0_13]) ).
cnf(c_0_73,negated_conjecture,
( esk4_0 != esk5_0
| ~ f(X1)
| ~ f(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_70]),c_0_67]) ).
cnf(c_0_74,negated_conjecture,
( esk3_1(esk5_0) = esk5_0
| f(esk1_0) ),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_75,negated_conjecture,
( esk3_1(X1) = esk5_0
| esk1_0 != esk5_0
| ~ f(X1) ),
inference(rw,[status(thm)],[c_0_70,c_0_68]) ).
cnf(c_0_76,negated_conjecture,
( esk1_0 != esk5_0
| ~ f(X1)
| ~ f(X2) ),
inference(rw,[status(thm)],[c_0_73,c_0_68]) ).
cnf(c_0_77,negated_conjecture,
( f(esk1_0)
| ~ f(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_74]),c_0_72])]) ).
cnf(c_0_78,negated_conjecture,
( esk1_0 != esk5_0
| ~ f(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_75]),c_0_76]) ).
cnf(c_0_79,negated_conjecture,
( esk5_0 = X1
| ~ f(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_72])]) ).
cnf(c_0_80,negated_conjecture,
f(esk1_0),
inference(spm,[status(thm)],[c_0_77,c_0_72]) ).
cnf(c_0_81,negated_conjecture,
esk1_0 != esk5_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_13]),c_0_78]) ).
cnf(c_0_82,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_81]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN415+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n027.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 19:04:15 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.iLFGRNXPxY/E---3.1_11012.p
% 0.20/0.52 # Version: 3.1pre001
% 0.20/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 11089 completed with status 0
% 0.20/0.52 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.20/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.52 # No SInE strategy applied
% 0.20/0.52 # Search class: FGHSF-FFSF11-SFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 0.20/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.20/0.52 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.52 # Starting sh5l with 136s (1) cores
% 0.20/0.52 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 11095 completed with status 0
% 0.20/0.52 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.20/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.52 # No SInE strategy applied
% 0.20/0.52 # Search class: FGHSF-FFSF11-SFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 0.20/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.20/0.52 # Preprocessing time : 0.002 s
% 0.20/0.52
% 0.20/0.52 # Proof found!
% 0.20/0.52 # SZS status Theorem
% 0.20/0.52 # SZS output start CNFRefutation
% See solution above
% 0.20/0.52 # Parsed axioms : 1
% 0.20/0.52 # Removed by relevancy pruning/SinE : 0
% 0.20/0.52 # Initial clauses : 10
% 0.20/0.52 # Removed in clause preprocessing : 0
% 0.20/0.52 # Initial clauses in saturation : 10
% 0.20/0.52 # Processed clauses : 482
% 0.20/0.52 # ...of these trivial : 0
% 0.20/0.52 # ...subsumed : 334
% 0.20/0.52 # ...remaining for further processing : 148
% 0.20/0.52 # Other redundant clauses eliminated : 4
% 0.20/0.52 # Clauses deleted for lack of memory : 0
% 0.20/0.52 # Backward-subsumed : 75
% 0.20/0.52 # Backward-rewritten : 63
% 0.20/0.52 # Generated clauses : 979
% 0.20/0.52 # ...of the previous two non-redundant : 935
% 0.20/0.52 # ...aggressively subsumed : 0
% 0.20/0.52 # Contextual simplify-reflections : 37
% 0.20/0.52 # Paramodulations : 956
% 0.20/0.52 # Factorizations : 19
% 0.20/0.52 # NegExts : 0
% 0.20/0.52 # Equation resolutions : 4
% 0.20/0.52 # Total rewrite steps : 80
% 0.20/0.52 # Propositional unsat checks : 0
% 0.20/0.52 # Propositional check models : 0
% 0.20/0.52 # Propositional check unsatisfiable : 0
% 0.20/0.52 # Propositional clauses : 0
% 0.20/0.52 # Propositional clauses after purity: 0
% 0.20/0.52 # Propositional unsat core size : 0
% 0.20/0.52 # Propositional preprocessing time : 0.000
% 0.20/0.52 # Propositional encoding time : 0.000
% 0.20/0.52 # Propositional solver time : 0.000
% 0.20/0.52 # Success case prop preproc time : 0.000
% 0.20/0.52 # Success case prop encoding time : 0.000
% 0.20/0.52 # Success case prop solver time : 0.000
% 0.20/0.52 # Current number of processed clauses : 10
% 0.20/0.52 # Positive orientable unit clauses : 4
% 0.20/0.52 # Positive unorientable unit clauses: 0
% 0.20/0.52 # Negative unit clauses : 1
% 0.20/0.52 # Non-unit-clauses : 5
% 0.20/0.52 # Current number of unprocessed clauses: 8
% 0.20/0.52 # ...number of literals in the above : 23
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 138
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 1782
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 909
% 0.20/0.52 # Non-unit clause-clause subsumptions : 441
% 0.20/0.52 # Unit Clause-clause subsumption calls : 7
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 4
% 0.20/0.52 # BW rewrite match successes : 4
% 0.20/0.52 # Condensation attempts : 0
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 9342
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.027 s
% 0.20/0.52 # System time : 0.002 s
% 0.20/0.52 # Total time : 0.029 s
% 0.20/0.52 # Maximum resident set size: 1720 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.135 s
% 0.20/0.52 # System time : 0.005 s
% 0.20/0.52 # Total time : 0.139 s
% 0.20/0.52 # Maximum resident set size: 1668 pages
% 0.20/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------