TSTP Solution File: SWC297-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC297-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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 19:42:27 EDT 2023
% Result : Unsatisfiable 0.21s 0.59s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 26
% Syntax : Number of clauses : 86 ( 29 unt; 15 nHn; 86 RR)
% Number of literals : 190 ( 78 equ; 95 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 48 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_10,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk1,
file('/export/starexec/sandbox/tmp/tmp.ySVtv2xFmX/E---3.1_22760.p',co1_10) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/tmp/tmp.ySVtv2xFmX/E---3.1_22760.p',co1_6) ).
cnf(clause119,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ySVtv2xFmX/E---3.1_22760.p',clause119) ).
cnf(co1_9,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox/tmp/tmp.ySVtv2xFmX/E---3.1_22760.p',co1_9) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ySVtv2xFmX/E---3.1_22760.p',clause118) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.ySVtv2xFmX/E---3.1_22760.p',clause85) ).
cnf(co1_8,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox/tmp/tmp.ySVtv2xFmX/E---3.1_22760.p',co1_8) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.ySVtv2xFmX/E---3.1_22760.p',clause86) ).
cnf(co1_7,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox/tmp/tmp.ySVtv2xFmX/E---3.1_22760.p',co1_7) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.ySVtv2xFmX/E---3.1_22760.p',clause8) ).
cnf(co1_12,negated_conjecture,
( memberP(sk6,sk8)
| memberP(sk7,sk8) ),
file('/export/starexec/sandbox/tmp/tmp.ySVtv2xFmX/E---3.1_22760.p',co1_12) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/tmp/tmp.ySVtv2xFmX/E---3.1_22760.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/tmp/tmp.ySVtv2xFmX/E---3.1_22760.p',co1_5) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ySVtv2xFmX/E---3.1_22760.p',clause71) ).
cnf(co1_11,negated_conjecture,
ssItem(sk8),
file('/export/starexec/sandbox/tmp/tmp.ySVtv2xFmX/E---3.1_22760.p',co1_11) ).
cnf(co1_18,negated_conjecture,
( cons(sk9,nil) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/tmp/tmp.ySVtv2xFmX/E---3.1_22760.p',co1_18) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.ySVtv2xFmX/E---3.1_22760.p',clause100) ).
cnf(co1_16,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox/tmp/tmp.ySVtv2xFmX/E---3.1_22760.p',co1_16) ).
cnf(co1_17,negated_conjecture,
( ssItem(sk9)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/tmp/tmp.ySVtv2xFmX/E---3.1_22760.p',co1_17) ).
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/tmp/tmp.ySVtv2xFmX/E---3.1_22760.p',clause149) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.ySVtv2xFmX/E---3.1_22760.p',clause120) ).
cnf(clause96,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.ySVtv2xFmX/E---3.1_22760.p',clause96) ).
cnf(clause133,axiom,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.ySVtv2xFmX/E---3.1_22760.p',clause133) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.ySVtv2xFmX/E---3.1_22760.p',clause98) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ySVtv2xFmX/E---3.1_22760.p',clause75) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ySVtv2xFmX/E---3.1_22760.p',clause74) ).
cnf(c_0_26,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk1,
co1_10 ).
cnf(c_0_27,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_28,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause119 ).
cnf(c_0_29,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk3,
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
ssList(sk7),
co1_9 ).
cnf(c_0_31,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause118 ).
cnf(c_0_32,negated_conjecture,
( sk7 = nil
| sk3 != nil
| ~ ssList(app(sk6,cons(sk5,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_33,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_34,negated_conjecture,
ssList(sk6),
co1_8 ).
cnf(c_0_35,negated_conjecture,
( app(sk6,cons(sk5,nil)) = nil
| sk3 != nil
| ~ ssList(app(sk6,cons(sk5,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_29]),c_0_30])]) ).
cnf(c_0_36,negated_conjecture,
( sk7 = nil
| sk3 != nil
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_37,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_38,negated_conjecture,
ssItem(sk5),
co1_7 ).
cnf(c_0_39,axiom,
ssList(nil),
clause8 ).
cnf(c_0_40,negated_conjecture,
( app(sk6,cons(sk5,nil)) = nil
| sk3 != nil
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_33]),c_0_34])]) ).
cnf(c_0_41,negated_conjecture,
( memberP(sk6,sk8)
| memberP(sk7,sk8) ),
co1_12 ).
cnf(c_0_42,negated_conjecture,
( sk7 = nil
| sk3 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_39])]) ).
cnf(c_0_43,negated_conjecture,
( sk6 = nil
| sk3 != nil
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_40]),c_0_34])]) ).
cnf(c_0_44,negated_conjecture,
( memberP(nil,sk8)
| memberP(sk6,sk8)
| sk3 != nil ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,negated_conjecture,
( sk6 = nil
| sk3 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_37]),c_0_38]),c_0_39])]) ).
cnf(c_0_46,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_47,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_48,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
clause71 ).
cnf(c_0_49,negated_conjecture,
( memberP(nil,sk8)
| sk3 != nil ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,negated_conjecture,
ssItem(sk8),
co1_11 ).
cnf(c_0_51,negated_conjecture,
( cons(sk9,nil) = sk3
| ~ neq(sk4,nil) ),
co1_18 ).
cnf(c_0_52,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_53,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_54,negated_conjecture,
sk3 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50])]) ).
cnf(c_0_55,negated_conjecture,
( nil = sk3
| nil != sk4 ),
co1_16 ).
cnf(c_0_56,negated_conjecture,
( ssItem(sk9)
| ~ neq(sk4,nil) ),
co1_17 ).
cnf(c_0_57,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause149 ).
cnf(c_0_58,negated_conjecture,
( cons(sk9,nil) = sk3
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]),c_0_39])]) ).
cnf(c_0_59,negated_conjecture,
sk4 != nil,
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_60,negated_conjecture,
( sk4 = nil
| ssItem(sk9) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_52]),c_0_53]),c_0_39])]) ).
cnf(c_0_61,negated_conjecture,
( app(sk6,app(cons(sk5,nil),sk7)) = sk3
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_57]),c_0_34]),c_0_30])]) ).
cnf(c_0_62,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_63,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause96 ).
cnf(c_0_64,negated_conjecture,
cons(sk9,nil) = sk3,
inference(sr,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_65,negated_conjecture,
ssItem(sk9),
inference(sr,[status(thm)],[c_0_60,c_0_59]) ).
cnf(c_0_66,axiom,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
clause133 ).
cnf(c_0_67,negated_conjecture,
( app(sk6,cons(sk5,sk7)) = sk3
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_38]),c_0_30])]) ).
cnf(c_0_68,negated_conjecture,
tl(sk3) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65]),c_0_39])]) ).
cnf(c_0_69,negated_conjecture,
( app(tl(sk6),cons(sk5,sk7)) = nil
| sk6 = nil
| ~ ssList(cons(sk5,sk7))
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68]),c_0_34])]) ).
cnf(c_0_70,negated_conjecture,
( cons(sk5,sk7) = nil
| sk6 = nil
| ~ ssList(cons(sk5,sk7))
| ~ ssList(cons(sk5,nil))
| ~ ssList(tl(sk6)) ),
inference(spm,[status(thm)],[c_0_28,c_0_69]) ).
cnf(c_0_71,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause98 ).
cnf(c_0_72,negated_conjecture,
( cons(sk5,sk7) = nil
| sk6 = nil
| ~ ssList(cons(sk5,nil))
| ~ ssList(tl(sk6)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_37]),c_0_38]),c_0_30])]) ).
cnf(c_0_73,negated_conjecture,
( sk6 = nil
| ~ ssList(cons(sk5,nil))
| ~ ssList(tl(sk6)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_38]),c_0_30])]) ).
cnf(c_0_74,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
clause75 ).
cnf(c_0_75,negated_conjecture,
( sk6 = nil
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_34])]) ).
cnf(c_0_76,negated_conjecture,
sk6 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_37]),c_0_38]),c_0_39])]) ).
cnf(c_0_77,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_78,negated_conjecture,
( app(nil,cons(sk5,sk7)) = sk3
| ~ ssList(cons(sk5,nil)) ),
inference(rw,[status(thm)],[c_0_67,c_0_76]) ).
cnf(c_0_79,negated_conjecture,
( cons(sk5,sk7) = sk3
| ~ ssList(cons(sk5,sk7))
| ~ ssList(cons(sk5,nil)) ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_80,negated_conjecture,
( cons(sk5,sk7) = sk3
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_37]),c_0_38]),c_0_30])]) ).
cnf(c_0_81,negated_conjecture,
( sk7 = nil
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_80]),c_0_68]),c_0_38]),c_0_30])]) ).
cnf(c_0_82,negated_conjecture,
( memberP(sk7,sk8)
| memberP(nil,sk8) ),
inference(rw,[status(thm)],[c_0_41,c_0_76]) ).
cnf(c_0_83,negated_conjecture,
sk7 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_37]),c_0_38]),c_0_39])]) ).
cnf(c_0_84,negated_conjecture,
memberP(nil,sk8),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_83])]) ).
cnf(c_0_85,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_84]),c_0_50])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWC297-1 : TPTP v8.1.2. Released v2.4.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n011.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 : Tue Oct 3 01:55:53 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.50 Running first-order model finding
% 0.21/0.50 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.ySVtv2xFmX/E---3.1_22760.p
% 0.21/0.59 # Version: 3.1pre001
% 0.21/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.59 # Starting sh5l with 300s (1) cores
% 0.21/0.59 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 22862 completed with status 0
% 0.21/0.59 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.21/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.59 # No SInE strategy applied
% 0.21/0.59 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.21/0.59 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.59 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.21/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.21/0.59 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.21/0.59 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.21/0.59 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 0.21/0.59 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 22870 completed with status 0
% 0.21/0.59 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.21/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.59 # No SInE strategy applied
% 0.21/0.59 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.21/0.59 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.59 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.21/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.21/0.59 # Preprocessing time : 0.004 s
% 0.21/0.59 # Presaturation interreduction done
% 0.21/0.59
% 0.21/0.59 # Proof found!
% 0.21/0.59 # SZS status Unsatisfiable
% 0.21/0.59 # SZS output start CNFRefutation
% See solution above
% 0.21/0.59 # Parsed axioms : 204
% 0.21/0.59 # Removed by relevancy pruning/SinE : 0
% 0.21/0.59 # Initial clauses : 204
% 0.21/0.59 # Removed in clause preprocessing : 0
% 0.21/0.59 # Initial clauses in saturation : 204
% 0.21/0.59 # Processed clauses : 617
% 0.21/0.59 # ...of these trivial : 8
% 0.21/0.59 # ...subsumed : 68
% 0.21/0.59 # ...remaining for further processing : 541
% 0.21/0.59 # Other redundant clauses eliminated : 74
% 0.21/0.59 # Clauses deleted for lack of memory : 0
% 0.21/0.59 # Backward-subsumed : 29
% 0.21/0.59 # Backward-rewritten : 28
% 0.21/0.59 # Generated clauses : 1397
% 0.21/0.59 # ...of the previous two non-redundant : 1217
% 0.21/0.59 # ...aggressively subsumed : 0
% 0.21/0.59 # Contextual simplify-reflections : 8
% 0.21/0.59 # Paramodulations : 1312
% 0.21/0.59 # Factorizations : 0
% 0.21/0.59 # NegExts : 0
% 0.21/0.59 # Equation resolutions : 79
% 0.21/0.59 # Total rewrite steps : 1509
% 0.21/0.59 # Propositional unsat checks : 0
% 0.21/0.59 # Propositional check models : 0
% 0.21/0.59 # Propositional check unsatisfiable : 0
% 0.21/0.59 # Propositional clauses : 0
% 0.21/0.59 # Propositional clauses after purity: 0
% 0.21/0.59 # Propositional unsat core size : 0
% 0.21/0.59 # Propositional preprocessing time : 0.000
% 0.21/0.59 # Propositional encoding time : 0.000
% 0.21/0.59 # Propositional solver time : 0.000
% 0.21/0.59 # Success case prop preproc time : 0.000
% 0.21/0.59 # Success case prop encoding time : 0.000
% 0.21/0.59 # Success case prop solver time : 0.000
% 0.21/0.59 # Current number of processed clauses : 258
% 0.21/0.59 # Positive orientable unit clauses : 81
% 0.21/0.59 # Positive unorientable unit clauses: 0
% 0.21/0.59 # Negative unit clauses : 4
% 0.21/0.59 # Non-unit-clauses : 173
% 0.21/0.59 # Current number of unprocessed clauses: 982
% 0.21/0.59 # ...number of literals in the above : 5889
% 0.21/0.59 # Current number of archived formulas : 0
% 0.21/0.59 # Current number of archived clauses : 260
% 0.21/0.59 # Clause-clause subsumption calls (NU) : 12551
% 0.21/0.59 # Rec. Clause-clause subsumption calls : 2412
% 0.21/0.59 # Non-unit clause-clause subsumptions : 79
% 0.21/0.59 # Unit Clause-clause subsumption calls : 642
% 0.21/0.59 # Rewrite failures with RHS unbound : 0
% 0.21/0.59 # BW rewrite match attempts : 6
% 0.21/0.59 # BW rewrite match successes : 6
% 0.21/0.59 # Condensation attempts : 0
% 0.21/0.59 # Condensation successes : 0
% 0.21/0.59 # Termbank termtop insertions : 32805
% 0.21/0.59
% 0.21/0.59 # -------------------------------------------------
% 0.21/0.59 # User time : 0.069 s
% 0.21/0.59 # System time : 0.006 s
% 0.21/0.59 # Total time : 0.076 s
% 0.21/0.59 # Maximum resident set size: 2116 pages
% 0.21/0.59
% 0.21/0.59 # -------------------------------------------------
% 0.21/0.59 # User time : 0.333 s
% 0.21/0.59 # System time : 0.034 s
% 0.21/0.59 # Total time : 0.367 s
% 0.21/0.59 # Maximum resident set size: 1852 pages
% 0.21/0.59 % E---3.1 exiting
%------------------------------------------------------------------------------