%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC053-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:42:47 PM UTC 2026
% Result : Unsatisfiable 0.45s 0.59s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 25
% Syntax : Number of clauses : 89 ( 22 unt; 18 nHn; 87 RR)
% Number of literals : 241 ( 62 equ; 148 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 70 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause154,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ frontsegP(X2,X3)
| ~ frontsegP(X1,X2)
| frontsegP(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause154) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(clause84,axiom,
( ~ ssList(X1)
| ~ frontsegP(nil,X1)
| nil = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause84) ).
cnf(co1_13,negated_conjecture,
( nil = sk3
| frontsegP(sk4,sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_8,negated_conjecture,
( nil = sk3
| ssList(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause83,axiom,
( ~ ssList(X1)
| nil != X1
| frontsegP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause83) ).
cnf(co1_18,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_18) ).
cnf(co1_17,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
cnf(clause115,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_12,negated_conjecture,
( nil = sk3
| neq(sk5,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(clause57,axiom,
( ~ ssList(X1)
| segmentP(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause57) ).
cnf(clause172,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause172) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause79,axiom,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause79) ).
cnf(clause132,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause132) ).
cnf(co1_16,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil = sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(co1_10,negated_conjecture,
( nil = sk4
| frontsegP(sk4,sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_7,negated_conjecture,
( nil = sk4
| ssList(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_9,negated_conjecture,
( nil = sk4
| neq(sk5,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_11,negated_conjecture,
( nil = sk4
| frontsegP(sk3,sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(c_0_25,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ frontsegP(X2,X3)
| ~ frontsegP(X1,X2)
| frontsegP(X1,X3) ),
inference(fof_simplification,[status(thm)],[clause154]) ).
cnf(c_0_26,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_27,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_28,plain,
( ~ ssList(X1)
| ~ frontsegP(nil,X1)
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause84]) ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ frontsegP(X2,X3)
| ~ frontsegP(X1,X2)
| frontsegP(X1,X3) ),
c_0_25 ).
cnf(c_0_30,negated_conjecture,
( nil = sk3
| frontsegP(sk4,sk5) ),
co1_13 ).
cnf(c_0_31,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
( nil = sk3
| ssList(sk5) ),
co1_8 ).
cnf(c_0_33,plain,
( ~ ssList(X1)
| ~ frontsegP(nil,X1)
| nil = X1 ),
c_0_28 ).
cnf(c_0_34,negated_conjecture,
( ~ ssList(X1)
| ~ frontsegP(X1,sk4)
| frontsegP(X1,sk5)
| sk3 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),c_0_32]) ).
cnf(c_0_35,axiom,
ssList(nil),
clause8 ).
cnf(c_0_36,plain,
( ~ ssList(X1)
| nil != X1
| frontsegP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause83]) ).
cnf(c_0_37,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil != sk1 ),
inference(fof_simplification,[status(thm)],[co1_18]) ).
cnf(c_0_38,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
inference(fof_simplification,[status(thm)],[co1_17]) ).
cnf(c_0_39,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_40,negated_conjecture,
( ~ frontsegP(nil,sk4)
| sk5 = nil
| sk3 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]),c_0_32]) ).
cnf(c_0_41,plain,
( ~ ssList(X1)
| nil != X1
| frontsegP(nil,X1) ),
c_0_36 ).
cnf(c_0_42,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil != sk1 ),
c_0_37 ).
cnf(c_0_43,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_44,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
c_0_38 ).
cnf(c_0_45,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
c_0_39 ).
cnf(c_0_46,negated_conjecture,
( nil = sk3
| neq(sk5,nil) ),
co1_12 ).
cnf(c_0_47,negated_conjecture,
( sk4 != nil
| sk3 = nil
| sk5 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_31])]) ).
cnf(c_0_48,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk4,X1)
| ~ segmentP(sk3,X1)
| ~ neq(X1,nil)
| sk3 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43]),c_0_43]),c_0_27]) ).
cnf(c_0_49,negated_conjecture,
( sk3 != nil
| neq(sk4,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_27]),c_0_43]) ).
cnf(c_0_50,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_45]) ).
cnf(c_0_51,negated_conjecture,
( sk4 != nil
| neq(nil,nil)
| sk3 = nil ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_52,negated_conjecture,
( ~ segmentP(sk4,sk4)
| ~ segmentP(sk3,sk4)
| sk3 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_31])]) ).
cnf(c_0_53,negated_conjecture,
( sk4 != nil
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_35])]) ).
cnf(c_0_54,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_55,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
inference(fof_simplification,[status(thm)],[clause172]) ).
cnf(c_0_56,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_57,negated_conjecture,
( ~ segmentP(sk4,sk4)
| ~ segmentP(nil,sk4)
| sk4 != nil ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_58,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
c_0_54 ).
cnf(c_0_59,plain,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause79]) ).
cnf(c_0_60,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
c_0_55 ).
cnf(c_0_61,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_56 ).
cnf(c_0_62,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_63,negated_conjecture,
( ~ segmentP(nil,sk4)
| sk4 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_31])]) ).
cnf(c_0_64,plain,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
c_0_59 ).
cnf(c_0_65,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil = sk2 ),
inference(fof_simplification,[status(thm)],[co1_16]) ).
cnf(c_0_66,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ segmentP(X1,X3)
| segmentP(app(X1,X2),X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_35])]) ).
cnf(c_0_67,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
c_0_62 ).
cnf(c_0_68,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_69,negated_conjecture,
( nil = sk4
| frontsegP(sk4,sk5) ),
co1_10 ).
cnf(c_0_70,negated_conjecture,
sk4 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_31])]) ).
cnf(c_0_71,negated_conjecture,
( nil = sk4
| ssList(sk5) ),
co1_7 ).
cnf(c_0_72,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil = sk2 ),
c_0_65 ).
cnf(c_0_73,negated_conjecture,
( nil = sk4
| neq(sk5,nil) ),
co1_9 ).
cnf(c_0_74,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ segmentP(X3,X2)
| ~ frontsegP(X1,X3)
| segmentP(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68])]) ).
cnf(c_0_75,negated_conjecture,
frontsegP(sk4,sk5),
inference(sr,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_76,negated_conjecture,
ssList(sk5),
inference(sr,[status(thm)],[c_0_71,c_0_70]) ).
cnf(c_0_77,negated_conjecture,
( nil = sk4
| frontsegP(sk3,sk5) ),
co1_11 ).
cnf(c_0_78,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_79,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk4,X1)
| ~ segmentP(sk3,X1)
| ~ neq(X1,nil)
| sk4 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_27]),c_0_43]),c_0_27]) ).
cnf(c_0_80,negated_conjecture,
neq(sk5,nil),
inference(sr,[status(thm)],[c_0_73,c_0_70]) ).
cnf(c_0_81,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk5,X1)
| segmentP(sk4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76]),c_0_31])]) ).
cnf(c_0_82,negated_conjecture,
frontsegP(sk3,sk5),
inference(sr,[status(thm)],[c_0_77,c_0_70]) ).
cnf(c_0_83,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_78,c_0_43]) ).
cnf(c_0_84,negated_conjecture,
( ~ segmentP(sk4,sk5)
| ~ segmentP(sk3,sk5) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_76])]),c_0_70]) ).
cnf(c_0_85,negated_conjecture,
segmentP(sk4,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_58]),c_0_76])]) ).
cnf(c_0_86,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk5,X1)
| segmentP(sk3,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_82]),c_0_76]),c_0_83])]) ).
cnf(c_0_87,negated_conjecture,
~ segmentP(sk3,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_85])]) ).
cnf(c_0_88,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_58]),c_0_76])]),c_0_87]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC053-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.37 % Computer : n012.cluster.edu
% 0.08/0.37 % Model : x86_64 x86_64
% 0.08/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.37 % Memory : 8046.5625MB
% 0.08/0.37 % OS : Linux 6.8.0-71-generic
% 0.08/0.37 % CPULimit : 300
% 0.08/0.37 % WCLimit : 300
% 0.08/0.37 % DateTime : Mon Sep 21 07:51:37 UTC 2026
% 0.08/0.38 % CPUTime :
% 0.08/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.42 Running first-order theorem proving
% 0.08/0.42 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.45/0.59 % Version: 3.5.1
% 0.45/0.59 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.45/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.59 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.45/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.45/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.45/0.59 % Starting sh5l with 300s (1) cores
% 0.45/0.59 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1926566 completed with status 0
% 0.45/0.59 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.45/0.59 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.45/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.59 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.45/0.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.45/0.59 % No SInE strategy applied
% 0.45/0.59 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.45/0.59 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.45/0.59 % Starting SubtermCWHack with 136s (1) cores
% 0.45/0.59 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.45/0.59 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.45/0.59 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.45/0.59 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.45/0.59 % G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with pid 1926573 completed with status 0
% 0.45/0.59 % Result found by G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y
% 0.45/0.59 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.45/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.59 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.45/0.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.45/0.59 % No SInE strategy applied
% 0.45/0.59 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.45/0.59 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.45/0.59 % Starting SubtermCWHack with 136s (1) cores
% 0.45/0.59 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.45/0.59 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.45/0.59 % Preprocessing time : 0.003 s
% 0.45/0.59 % Presaturation interreduction done
% 0.45/0.59
% 0.45/0.59 % Proof found!
% 0.45/0.59 % SZS status Unsatisfiable
% 0.45/0.59 % SZS output start CNFRefutation
% See solution above
% 0.45/0.59 % Parsed axioms : 203
% 0.45/0.59 % Removed by relevancy pruning/SinE : 0
% 0.45/0.59 % Initial clauses : 203
% 0.45/0.59 % Removed in clause preprocessing : 0
% 0.45/0.59 % Initial clauses in saturation : 203
% 0.45/0.59 % Processed clauses : 1292
% 0.45/0.59 % ...of these trivial : 106
% 0.45/0.59 % ...subsumed : 449
% 0.45/0.59 % ...remaining for further processing : 737
% 0.45/0.59 % Other redundant clauses eliminated : 122
% 0.45/0.59 % Clauses deleted for lack of memory : 0
% 0.45/0.59 % Backward-subsumed : 82
% 0.45/0.59 % Backward-rewritten : 9
% 0.45/0.59 % Generated clauses : 4260
% 0.45/0.59 % ...of the previous two non-redundant : 3652
% 0.45/0.59 % ...aggressively subsumed : 0
% 0.45/0.59 % Contextual simplify-reflections : 75
% 0.45/0.59 % Paramodulations : 4071
% 0.45/0.59 % Factorizations : 0
% 0.45/0.59 % NegExts : 0
% 0.45/0.59 % Equation resolutions : 145
% 0.45/0.59 % Disequality decompositions : 0
% 0.45/0.59 % Total rewrite steps : 3377
% 0.45/0.59 % ...of those cached : 3190
% 0.45/0.59 % Propositional unsat checks : 0
% 0.45/0.59 % Propositional check models : 0
% 0.45/0.59 % Propositional check unsatisfiable : 0
% 0.45/0.59 % Propositional clauses : 0
% 0.45/0.59 % Propositional clauses after purity: 0
% 0.45/0.59 % Propositional unsat core size : 0
% 0.45/0.59 % Propositional preprocessing time : 0.000
% 0.45/0.59 % Propositional encoding time : 0.000
% 0.45/0.59 % Propositional solver time : 0.000
% 0.45/0.59 % Success case prop preproc time : 0.000
% 0.45/0.59 % Success case prop encoding time : 0.000
% 0.45/0.59 % Success case prop solver time : 0.000
% 0.45/0.59 % Current number of processed clauses : 403
% 0.45/0.59 % Positive orientable unit clauses : 80
% 0.45/0.59 % Positive unorientable unit clauses: 0
% 0.45/0.59 % Negative unit clauses : 12
% 0.45/0.59 % Non-unit-clauses : 311
% 0.45/0.59 % Current number of unprocessed clauses: 2520
% 0.45/0.59 % ...number of literals in the above : 16858
% 0.45/0.59 % Current number of archived formulas : 0
% 0.45/0.59 % Current number of archived clauses : 326
% 0.45/0.59 % Clause-clause subsumption calls (NU) : 40874
% 0.45/0.59 % Rec. Clause-clause subsumption calls : 8438
% 0.45/0.59 % Non-unit clause-clause subsumptions : 438
% 0.45/0.59 % Unit Clause-clause subsumption calls : 2009
% 0.45/0.59 % Rewrite failures with RHS unbound : 0
% 0.45/0.59 % BW rewrite match attempts : 10
% 0.45/0.59 % BW rewrite match successes : 10
% 0.45/0.59 % Condensation attempts : 0
% 0.45/0.59 % Condensation successes : 0
% 0.45/0.59 % Termbank termtop insertions : 82168
% 0.45/0.59 % Search garbage collected termcells : 544
% 0.45/0.59
% 0.45/0.59 % -------------------------------------------------
% 0.45/0.59 % User time : 0.122 s
% 0.45/0.59 % System time : 0.008 s
% 0.45/0.59 % Total time : 0.130 s
% 0.45/0.59 % Maximum resident set size: 4068 pages
% 0.45/0.59
% 0.45/0.59 % -------------------------------------------------
% 0.45/0.59 % User time : 0.494 s
% 0.45/0.59 % System time : 0.039 s
% 0.45/0.59 % Total time : 0.533 s
% 0.45/0.59 % Maximum resident set size: 5120 pages
% 0.45/0.59 % E exiting
%------------------------------------------------------------------------------