TSTP Solution File: NUM448+5 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUM448+5 : TPTP v8.1.2. Released v4.0.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 09:06:04 EDT 2024
% Result : Theorem 0.21s 0.54s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 43 ( 7 unt; 0 def)
% Number of atoms : 280 ( 65 equ)
% Maximal formula atoms : 102 ( 6 avg)
% Number of connectives : 369 ( 132 ~; 141 |; 73 &)
% ( 8 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 41 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 5 con; 0-2 aty)
% Number of variables : 57 ( 0 sgn 22 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ! [X1] :
( aInteger0(X1)
=> ( ( ( ? [X2] :
( aElementOf0(X2,xS)
& aElementOf0(X1,X2) )
| aElementOf0(X1,sbsmnsldt0(xS)) )
=> ? [X2] :
( aInteger0(X2)
& X2 != sz00
& ? [X3] :
( aInteger0(X3)
& sdtasdt0(X2,X3) = X1 )
& aDivisorOf0(X2,X1)
& isPrime0(X2) ) )
& ( ? [X2] :
( ( ( aInteger0(X2)
& X2 != sz00
& ? [X3] :
( aInteger0(X3)
& sdtasdt0(X2,X3) = X1 ) )
| aDivisorOf0(X2,X1) )
& isPrime0(X2) )
=> ( ? [X2] :
( aElementOf0(X2,xS)
& aElementOf0(X1,X2) )
& aElementOf0(X1,sbsmnsldt0(xS)) ) ) ) )
=> ( ( aSet0(sbsmnsldt0(xS))
& ! [X1] :
( aElementOf0(X1,sbsmnsldt0(xS))
<=> ( aInteger0(X1)
& ? [X2] :
( aElementOf0(X2,xS)
& aElementOf0(X1,X2) ) ) ) )
=> ( ( aSet0(stldt0(sbsmnsldt0(xS)))
& ! [X1] :
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
<=> ( aInteger0(X1)
& ~ aElementOf0(X1,sbsmnsldt0(xS)) ) ) )
=> ( ! [X1] :
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
<=> ( X1 = sz10
| X1 = smndt0(sz10) ) )
| stldt0(sbsmnsldt0(xS)) = cS2076 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.I6ecrxxvZh/E---3.1_10139.p',m__) ).
fof(mPrimeDivisor,axiom,
! [X1] :
( aInteger0(X1)
=> ( ? [X2] :
( aDivisorOf0(X2,X1)
& isPrime0(X2) )
<=> ( X1 != sz10
& X1 != smndt0(sz10) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.I6ecrxxvZh/E---3.1_10139.p',mPrimeDivisor) ).
fof(mIntNeg,axiom,
! [X1] :
( aInteger0(X1)
=> aInteger0(smndt0(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.I6ecrxxvZh/E---3.1_10139.p',mIntNeg) ).
fof(mIntOne,axiom,
aInteger0(sz10),
file('/export/starexec/sandbox2/tmp/tmp.I6ecrxxvZh/E---3.1_10139.p',mIntOne) ).
fof(c_0_4,negated_conjecture,
~ ( ! [X1] :
( aInteger0(X1)
=> ( ( ( ? [X2] :
( aElementOf0(X2,xS)
& aElementOf0(X1,X2) )
| aElementOf0(X1,sbsmnsldt0(xS)) )
=> ? [X2] :
( aInteger0(X2)
& X2 != sz00
& ? [X3] :
( aInteger0(X3)
& sdtasdt0(X2,X3) = X1 )
& aDivisorOf0(X2,X1)
& isPrime0(X2) ) )
& ( ? [X2] :
( ( ( aInteger0(X2)
& X2 != sz00
& ? [X3] :
( aInteger0(X3)
& sdtasdt0(X2,X3) = X1 ) )
| aDivisorOf0(X2,X1) )
& isPrime0(X2) )
=> ( ? [X2] :
( aElementOf0(X2,xS)
& aElementOf0(X1,X2) )
& aElementOf0(X1,sbsmnsldt0(xS)) ) ) ) )
=> ( ( aSet0(sbsmnsldt0(xS))
& ! [X1] :
( aElementOf0(X1,sbsmnsldt0(xS))
<=> ( aInteger0(X1)
& ? [X2] :
( aElementOf0(X2,xS)
& aElementOf0(X1,X2) ) ) ) )
=> ( ( aSet0(stldt0(sbsmnsldt0(xS)))
& ! [X1] :
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
<=> ( aInteger0(X1)
& ~ aElementOf0(X1,sbsmnsldt0(xS)) ) ) )
=> ( ! [X1] :
( aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
<=> ( X1 = sz10
| X1 = smndt0(sz10) ) )
| stldt0(sbsmnsldt0(xS)) = cS2076 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
fof(c_0_5,negated_conjecture,
! [X17,X18,X21,X22,X24,X26,X27,X28] :
( ( aInteger0(esk4_1(X17))
| ~ aElementOf0(X18,xS)
| ~ aElementOf0(X17,X18)
| ~ aInteger0(X17) )
& ( esk4_1(X17) != sz00
| ~ aElementOf0(X18,xS)
| ~ aElementOf0(X17,X18)
| ~ aInteger0(X17) )
& ( aInteger0(esk5_1(X17))
| ~ aElementOf0(X18,xS)
| ~ aElementOf0(X17,X18)
| ~ aInteger0(X17) )
& ( sdtasdt0(esk4_1(X17),esk5_1(X17)) = X17
| ~ aElementOf0(X18,xS)
| ~ aElementOf0(X17,X18)
| ~ aInteger0(X17) )
& ( aDivisorOf0(esk4_1(X17),X17)
| ~ aElementOf0(X18,xS)
| ~ aElementOf0(X17,X18)
| ~ aInteger0(X17) )
& ( isPrime0(esk4_1(X17))
| ~ aElementOf0(X18,xS)
| ~ aElementOf0(X17,X18)
| ~ aInteger0(X17) )
& ( aInteger0(esk4_1(X17))
| ~ aElementOf0(X17,sbsmnsldt0(xS))
| ~ aInteger0(X17) )
& ( esk4_1(X17) != sz00
| ~ aElementOf0(X17,sbsmnsldt0(xS))
| ~ aInteger0(X17) )
& ( aInteger0(esk5_1(X17))
| ~ aElementOf0(X17,sbsmnsldt0(xS))
| ~ aInteger0(X17) )
& ( sdtasdt0(esk4_1(X17),esk5_1(X17)) = X17
| ~ aElementOf0(X17,sbsmnsldt0(xS))
| ~ aInteger0(X17) )
& ( aDivisorOf0(esk4_1(X17),X17)
| ~ aElementOf0(X17,sbsmnsldt0(xS))
| ~ aInteger0(X17) )
& ( isPrime0(esk4_1(X17))
| ~ aElementOf0(X17,sbsmnsldt0(xS))
| ~ aInteger0(X17) )
& ( aElementOf0(esk6_1(X17),xS)
| ~ aInteger0(X21)
| X21 = sz00
| ~ aInteger0(X22)
| sdtasdt0(X21,X22) != X17
| ~ isPrime0(X21)
| ~ aInteger0(X17) )
& ( aElementOf0(X17,esk6_1(X17))
| ~ aInteger0(X21)
| X21 = sz00
| ~ aInteger0(X22)
| sdtasdt0(X21,X22) != X17
| ~ isPrime0(X21)
| ~ aInteger0(X17) )
& ( aElementOf0(X17,sbsmnsldt0(xS))
| ~ aInteger0(X21)
| X21 = sz00
| ~ aInteger0(X22)
| sdtasdt0(X21,X22) != X17
| ~ isPrime0(X21)
| ~ aInteger0(X17) )
& ( aElementOf0(esk6_1(X17),xS)
| ~ aDivisorOf0(X21,X17)
| ~ isPrime0(X21)
| ~ aInteger0(X17) )
& ( aElementOf0(X17,esk6_1(X17))
| ~ aDivisorOf0(X21,X17)
| ~ isPrime0(X21)
| ~ aInteger0(X17) )
& ( aElementOf0(X17,sbsmnsldt0(xS))
| ~ aDivisorOf0(X21,X17)
| ~ isPrime0(X21)
| ~ aInteger0(X17) )
& aSet0(sbsmnsldt0(xS))
& ( aInteger0(X24)
| ~ aElementOf0(X24,sbsmnsldt0(xS)) )
& ( aElementOf0(esk7_1(X24),xS)
| ~ aElementOf0(X24,sbsmnsldt0(xS)) )
& ( aElementOf0(X24,esk7_1(X24))
| ~ aElementOf0(X24,sbsmnsldt0(xS)) )
& ( ~ aInteger0(X26)
| ~ aElementOf0(X27,xS)
| ~ aElementOf0(X26,X27)
| aElementOf0(X26,sbsmnsldt0(xS)) )
& aSet0(stldt0(sbsmnsldt0(xS)))
& ( aInteger0(X28)
| ~ aElementOf0(X28,stldt0(sbsmnsldt0(xS))) )
& ( ~ aElementOf0(X28,sbsmnsldt0(xS))
| ~ aElementOf0(X28,stldt0(sbsmnsldt0(xS))) )
& ( ~ aInteger0(X28)
| aElementOf0(X28,sbsmnsldt0(xS))
| aElementOf0(X28,stldt0(sbsmnsldt0(xS))) )
& ( esk8_0 != sz10
| ~ aElementOf0(esk8_0,stldt0(sbsmnsldt0(xS))) )
& ( esk8_0 != smndt0(sz10)
| ~ aElementOf0(esk8_0,stldt0(sbsmnsldt0(xS))) )
& ( aElementOf0(esk8_0,stldt0(sbsmnsldt0(xS)))
| esk8_0 = sz10
| esk8_0 = smndt0(sz10) )
& stldt0(sbsmnsldt0(xS)) != cS2076 ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])])])]) ).
fof(c_0_6,plain,
! [X1] :
( aInteger0(X1)
=> ( ? [X2] :
( aDivisorOf0(X2,X1)
& isPrime0(X2) )
<=> ( X1 != sz10
& X1 != smndt0(sz10) ) ) ),
inference(fof_simplification,[status(thm)],[mPrimeDivisor]) ).
fof(c_0_7,plain,
! [X90] :
( ~ aInteger0(X90)
| aInteger0(smndt0(X90)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntNeg])])]) ).
cnf(c_0_8,negated_conjecture,
( aInteger0(X1)
| ~ aElementOf0(X1,stldt0(sbsmnsldt0(xS))) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
( aElementOf0(esk8_0,stldt0(sbsmnsldt0(xS)))
| esk8_0 = sz10
| esk8_0 = smndt0(sz10) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_10,plain,
! [X75,X76] :
( ( X75 != sz10
| ~ aDivisorOf0(X76,X75)
| ~ isPrime0(X76)
| ~ aInteger0(X75) )
& ( X75 != smndt0(sz10)
| ~ aDivisorOf0(X76,X75)
| ~ isPrime0(X76)
| ~ aInteger0(X75) )
& ( aDivisorOf0(esk14_1(X75),X75)
| X75 = sz10
| X75 = smndt0(sz10)
| ~ aInteger0(X75) )
& ( isPrime0(esk14_1(X75))
| X75 = sz10
| X75 = smndt0(sz10)
| ~ aInteger0(X75) ) ),
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_6])])])])])]) ).
cnf(c_0_11,plain,
( aInteger0(smndt0(X1))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
( smndt0(sz10) = esk8_0
| esk8_0 = sz10
| aInteger0(esk8_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
aInteger0(sz10),
inference(split_conjunct,[status(thm)],[mIntOne]) ).
cnf(c_0_14,plain,
( X1 != smndt0(sz10)
| ~ aDivisorOf0(X2,X1)
| ~ isPrime0(X2)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
( aDivisorOf0(esk4_1(X1),X1)
| ~ aElementOf0(X1,sbsmnsldt0(xS))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
( aInteger0(X1)
| ~ aElementOf0(X1,sbsmnsldt0(xS)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,negated_conjecture,
( isPrime0(esk4_1(X1))
| ~ aElementOf0(X1,sbsmnsldt0(xS))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,plain,
( aDivisorOf0(esk14_1(X1),X1)
| X1 = sz10
| X1 = smndt0(sz10)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,negated_conjecture,
( esk8_0 = sz10
| aInteger0(esk8_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_20,plain,
( isPrime0(esk14_1(X1))
| X1 = sz10
| X1 = smndt0(sz10)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,negated_conjecture,
( ~ aElementOf0(X1,sbsmnsldt0(xS))
| ~ aElementOf0(X1,stldt0(sbsmnsldt0(xS))) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_22,negated_conjecture,
( aElementOf0(X1,sbsmnsldt0(xS))
| aElementOf0(X1,stldt0(sbsmnsldt0(xS)))
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_23,plain,
( ~ isPrime0(X1)
| ~ aDivisorOf0(X1,smndt0(sz10))
| ~ aInteger0(smndt0(sz10)) ),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_24,negated_conjecture,
( aDivisorOf0(esk4_1(X1),X1)
| ~ aElementOf0(X1,sbsmnsldt0(xS)) ),
inference(csr,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_25,negated_conjecture,
( isPrime0(esk4_1(X1))
| ~ aElementOf0(X1,sbsmnsldt0(xS)) ),
inference(csr,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_26,negated_conjecture,
( aElementOf0(X1,sbsmnsldt0(xS))
| ~ aDivisorOf0(X2,X1)
| ~ isPrime0(X2)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_27,negated_conjecture,
( smndt0(sz10) = esk8_0
| esk8_0 = sz10
| aDivisorOf0(esk14_1(esk8_0),esk8_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_28,negated_conjecture,
( smndt0(sz10) = esk8_0
| esk8_0 = sz10
| isPrime0(esk14_1(esk8_0)) ),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_29,negated_conjecture,
( smndt0(sz10) = esk8_0
| esk8_0 = sz10
| ~ aElementOf0(esk8_0,sbsmnsldt0(xS)) ),
inference(spm,[status(thm)],[c_0_21,c_0_9]) ).
cnf(c_0_30,plain,
( X1 != sz10
| ~ aDivisorOf0(X2,X1)
| ~ isPrime0(X2)
| ~ aInteger0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_31,negated_conjecture,
( esk8_0 != smndt0(sz10)
| ~ aElementOf0(esk8_0,stldt0(sbsmnsldt0(xS))) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_32,negated_conjecture,
( esk8_0 = sz10
| aElementOf0(esk8_0,stldt0(sbsmnsldt0(xS)))
| aElementOf0(esk8_0,sbsmnsldt0(xS)) ),
inference(spm,[status(thm)],[c_0_22,c_0_19]) ).
cnf(c_0_33,negated_conjecture,
~ aElementOf0(smndt0(sz10),sbsmnsldt0(xS)),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_16]),c_0_25]) ).
cnf(c_0_34,negated_conjecture,
( smndt0(sz10) = esk8_0
| esk8_0 = sz10 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_19]),c_0_28]),c_0_29]) ).
cnf(c_0_35,plain,
( ~ isPrime0(X1)
| ~ aDivisorOf0(X1,sz10) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_30]),c_0_13])]) ).
cnf(c_0_36,negated_conjecture,
( esk8_0 = sz10
| aElementOf0(esk8_0,sbsmnsldt0(xS))
| smndt0(sz10) != esk8_0 ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
( esk8_0 = sz10
| ~ aElementOf0(esk8_0,sbsmnsldt0(xS)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,negated_conjecture,
~ aElementOf0(sz10,sbsmnsldt0(xS)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_24]),c_0_25]) ).
cnf(c_0_39,negated_conjecture,
( esk8_0 != sz10
| ~ aElementOf0(esk8_0,stldt0(sbsmnsldt0(xS))) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_40,negated_conjecture,
esk8_0 = sz10,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_34]),c_0_37]) ).
cnf(c_0_41,negated_conjecture,
aElementOf0(sz10,stldt0(sbsmnsldt0(xS))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_13]),c_0_38]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40]),c_0_40]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : NUM448+5 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n002.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 09:35:57 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.I6ecrxxvZh/E---3.1_10139.p
% 0.21/0.54 # Version: 3.1.0
% 0.21/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 # Starting sh5l with 300s (1) cores
% 0.21/0.54 # new_bool_3 with pid 10264 completed with status 0
% 0.21/0.54 # Result found by new_bool_3
% 0.21/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.54 # Search class: FGHSF-FSLM31-SFFFFFNN
% 0.21/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 148s (1) cores
% 0.21/0.54 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 10273 completed with status 0
% 0.21/0.54 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.54 # Search class: FGHSF-FSLM31-SFFFFFNN
% 0.21/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 148s (1) cores
% 0.21/0.54 # Preprocessing time : 0.004 s
% 0.21/0.54 # Presaturation interreduction done
% 0.21/0.54
% 0.21/0.54 # Proof found!
% 0.21/0.54 # SZS status Theorem
% 0.21/0.54 # SZS output start CNFRefutation
% See solution above
% 0.21/0.54 # Parsed axioms : 43
% 0.21/0.54 # Removed by relevancy pruning/SinE : 6
% 0.21/0.54 # Initial clauses : 145
% 0.21/0.54 # Removed in clause preprocessing : 4
% 0.21/0.54 # Initial clauses in saturation : 141
% 0.21/0.54 # Processed clauses : 321
% 0.21/0.54 # ...of these trivial : 0
% 0.21/0.54 # ...subsumed : 23
% 0.21/0.54 # ...remaining for further processing : 298
% 0.21/0.54 # Other redundant clauses eliminated : 28
% 0.21/0.54 # Clauses deleted for lack of memory : 0
% 0.21/0.54 # Backward-subsumed : 7
% 0.21/0.54 # Backward-rewritten : 25
% 0.21/0.54 # Generated clauses : 324
% 0.21/0.54 # ...of the previous two non-redundant : 283
% 0.21/0.54 # ...aggressively subsumed : 0
% 0.21/0.54 # Contextual simplify-reflections : 22
% 0.21/0.54 # Paramodulations : 296
% 0.21/0.54 # Factorizations : 0
% 0.21/0.54 # NegExts : 0
% 0.21/0.54 # Equation resolutions : 28
% 0.21/0.54 # Disequality decompositions : 0
% 0.21/0.54 # Total rewrite steps : 142
% 0.21/0.54 # ...of those cached : 135
% 0.21/0.54 # Propositional unsat checks : 0
% 0.21/0.54 # Propositional check models : 0
% 0.21/0.54 # Propositional check unsatisfiable : 0
% 0.21/0.54 # Propositional clauses : 0
% 0.21/0.54 # Propositional clauses after purity: 0
% 0.21/0.54 # Propositional unsat core size : 0
% 0.21/0.54 # Propositional preprocessing time : 0.000
% 0.21/0.54 # Propositional encoding time : 0.000
% 0.21/0.54 # Propositional solver time : 0.000
% 0.21/0.54 # Success case prop preproc time : 0.000
% 0.21/0.54 # Success case prop encoding time : 0.000
% 0.21/0.54 # Success case prop solver time : 0.000
% 0.21/0.54 # Current number of processed clauses : 99
% 0.21/0.54 # Positive orientable unit clauses : 10
% 0.21/0.54 # Positive unorientable unit clauses: 0
% 0.21/0.54 # Negative unit clauses : 3
% 0.21/0.54 # Non-unit-clauses : 86
% 0.21/0.54 # Current number of unprocessed clauses: 243
% 0.21/0.54 # ...number of literals in the above : 999
% 0.21/0.54 # Current number of archived formulas : 0
% 0.21/0.54 # Current number of archived clauses : 173
% 0.21/0.54 # Clause-clause subsumption calls (NU) : 6309
% 0.21/0.54 # Rec. Clause-clause subsumption calls : 1358
% 0.21/0.54 # Non-unit clause-clause subsumptions : 50
% 0.21/0.54 # Unit Clause-clause subsumption calls : 33
% 0.21/0.54 # Rewrite failures with RHS unbound : 0
% 0.21/0.54 # BW rewrite match attempts : 2
% 0.21/0.54 # BW rewrite match successes : 2
% 0.21/0.54 # Condensation attempts : 0
% 0.21/0.54 # Condensation successes : 0
% 0.21/0.54 # Termbank termtop insertions : 17253
% 0.21/0.54 # Search garbage collected termcells : 2807
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.038 s
% 0.21/0.54 # System time : 0.002 s
% 0.21/0.54 # Total time : 0.040 s
% 0.21/0.54 # Maximum resident set size: 2220 pages
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.040 s
% 0.21/0.54 # System time : 0.006 s
% 0.21/0.54 # Total time : 0.045 s
% 0.21/0.54 # Maximum resident set size: 1756 pages
% 0.21/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------