%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC327-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 : n018.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:43:57 PM UTC 2026
% Result : Unsatisfiable 0.62s 0.51s
% Output : CNFRefutation 0.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 20
% Syntax : Number of clauses : 84 ( 20 unt; 25 nHn; 84 RR)
% Number of literals : 268 ( 127 equ; 168 neg)
% Maximal clause size : 5 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 79 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_17,negated_conjecture,
( ~ equalelemsP(sk1)
| app(sk1,X1) != sk2
| ~ ssList(X1)
| nil = sk1
| app(sk8(X1),cons(sk6(X1),nil)) = sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
cnf(co1_9,negated_conjecture,
equalelemsP(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_16,negated_conjecture,
( ~ equalelemsP(sk1)
| app(sk1,X1) != sk2
| ~ ssList(X1)
| nil = sk1
| ssList(sk8(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
cnf(co1_12,negated_conjecture,
( ~ equalelemsP(sk1)
| app(sk1,X1) != sk2
| ~ ssList(X1)
| nil = sk1
| ssItem(sk6(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_10,negated_conjecture,
( app(X3,cons(X1,nil)) != sk3
| ~ ssList(X3)
| app(cons(X1,nil),X2) != sk5
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_8,negated_conjecture,
app(sk3,sk5) = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_15,negated_conjecture,
( ~ equalelemsP(sk1)
| app(sk1,X1) != sk2
| ~ ssList(X1)
| nil = sk1
| app(cons(sk6(X1),nil),sk7(X1)) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_14,negated_conjecture,
( ~ equalelemsP(sk1)
| app(sk1,X1) != sk2
| ~ ssList(X1)
| nil = sk1
| ssList(sk7(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_7,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_11,negated_conjecture,
( nil != sk3
| nil = sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_19,negated_conjecture,
( nil != sk2
| ~ equalelemsP(sk1)
| app(sk1,X1) != sk2
| ~ ssList(X1)
| app(cons(sk6(X1),nil),sk7(X1)) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_19) ).
cnf(co1_13,negated_conjecture,
( nil != sk2
| ~ equalelemsP(sk1)
| app(sk1,X1) != sk2
| ~ ssList(X1)
| ssItem(sk6(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_18,negated_conjecture,
( nil != sk2
| ~ equalelemsP(sk1)
| app(sk1,X1) != sk2
| ~ ssList(X1)
| ssList(sk7(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_18) ).
cnf(clause98,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(clause157,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause157) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(c_0_20,negated_conjecture,
( ~ equalelemsP(sk1)
| app(sk1,X1) != sk2
| ~ ssList(X1)
| nil = sk1
| app(sk8(X1),cons(sk6(X1),nil)) = sk1 ),
inference(fof_simplification,[status(thm)],[co1_17]) ).
cnf(c_0_21,negated_conjecture,
equalelemsP(sk3),
co1_9 ).
cnf(c_0_22,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_23,negated_conjecture,
( ~ equalelemsP(sk1)
| app(sk1,X1) != sk2
| ~ ssList(X1)
| nil = sk1
| ssList(sk8(X1)) ),
inference(fof_simplification,[status(thm)],[co1_16]) ).
cnf(c_0_24,negated_conjecture,
( ~ equalelemsP(sk1)
| app(sk1,X1) != sk2
| ~ ssList(X1)
| nil = sk1
| ssItem(sk6(X1)) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_25,negated_conjecture,
( app(X3,cons(X1,nil)) != sk3
| ~ ssList(X3)
| app(cons(X1,nil),X2) != sk5
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_26,negated_conjecture,
( ~ equalelemsP(sk1)
| app(sk1,X1) != sk2
| ~ ssList(X1)
| nil = sk1
| app(sk8(X1),cons(sk6(X1),nil)) = sk1 ),
c_0_20 ).
cnf(c_0_27,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_28,negated_conjecture,
equalelemsP(sk1),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,negated_conjecture,
app(sk3,sk5) = sk4,
co1_8 ).
cnf(c_0_30,negated_conjecture,
( ~ equalelemsP(sk1)
| app(sk1,X1) != sk2
| ~ ssList(X1)
| nil = sk1
| ssList(sk8(X1)) ),
c_0_23 ).
cnf(c_0_31,negated_conjecture,
( ~ equalelemsP(sk1)
| app(sk1,X1) != sk2
| ~ ssList(X1)
| nil = sk1
| ssItem(sk6(X1)) ),
c_0_24 ).
cnf(c_0_32,negated_conjecture,
( ~ equalelemsP(sk1)
| app(sk1,X1) != sk2
| ~ ssList(X1)
| nil = sk1
| app(cons(sk6(X1),nil),sk7(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[co1_15]) ).
cnf(c_0_33,negated_conjecture,
( ~ equalelemsP(sk1)
| app(sk1,X1) != sk2
| ~ ssList(X1)
| nil = sk1
| ssList(sk7(X1)) ),
inference(fof_simplification,[status(thm)],[co1_14]) ).
cnf(c_0_34,negated_conjecture,
( app(X3,cons(X1,nil)) != sk3
| ~ ssList(X3)
| app(cons(X1,nil),X2) != sk5
| ~ ssList(X2)
| ~ ssItem(X1) ),
c_0_25 ).
cnf(c_0_35,negated_conjecture,
( ~ ssList(X1)
| app(sk1,X1) != sk4
| nil = sk1
| app(sk8(X1),cons(sk6(X1),nil)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_36,negated_conjecture,
app(sk1,sk5) = sk4,
inference(rw,[status(thm)],[c_0_29,c_0_22]) ).
cnf(c_0_37,negated_conjecture,
ssList(sk5),
co1_7 ).
cnf(c_0_38,negated_conjecture,
( ~ ssList(X1)
| app(sk1,X1) != sk4
| ssList(sk8(X1))
| nil = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_27]),c_0_28])]) ).
cnf(c_0_39,negated_conjecture,
( ~ ssList(X1)
| app(sk1,X1) != sk4
| ssItem(sk6(X1))
| nil = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_27]),c_0_28])]) ).
cnf(c_0_40,negated_conjecture,
( ~ equalelemsP(sk1)
| app(sk1,X1) != sk2
| ~ ssList(X1)
| nil = sk1
| app(cons(sk6(X1),nil),sk7(X1)) = X1 ),
c_0_32 ).
cnf(c_0_41,negated_conjecture,
( ~ equalelemsP(sk1)
| app(sk1,X1) != sk2
| ~ ssList(X1)
| nil = sk1
| ssList(sk7(X1)) ),
c_0_33 ).
cnf(c_0_42,negated_conjecture,
( nil != sk3
| nil = sk4 ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_43,negated_conjecture,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| app(cons(X2,nil),X3) != sk5
| app(X1,cons(X2,nil)) != sk1 ),
inference(rw,[status(thm)],[c_0_34,c_0_22]) ).
cnf(c_0_44,negated_conjecture,
( nil = sk1
| app(sk8(sk5),cons(sk6(sk5),nil)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
cnf(c_0_45,negated_conjecture,
( ssList(sk8(sk5))
| nil = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_36]),c_0_37])]) ).
cnf(c_0_46,negated_conjecture,
( ssItem(sk6(sk5))
| nil = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_36]),c_0_37])]) ).
cnf(c_0_47,negated_conjecture,
( ~ ssList(X1)
| app(sk1,X1) != sk4
| nil = sk1
| app(cons(sk6(X1),nil),sk7(X1)) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_27]),c_0_28])]) ).
cnf(c_0_48,negated_conjecture,
( ~ ssList(X1)
| app(sk1,X1) != sk4
| ssList(sk7(X1))
| nil = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_27]),c_0_28])]) ).
cnf(c_0_49,negated_conjecture,
( nil != sk2
| ~ equalelemsP(sk1)
| app(sk1,X1) != sk2
| ~ ssList(X1)
| app(cons(sk6(X1),nil),sk7(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[co1_19]) ).
cnf(c_0_50,negated_conjecture,
( nil != sk3
| nil = sk4 ),
c_0_42 ).
cnf(c_0_51,negated_conjecture,
( ~ ssList(X1)
| app(cons(sk6(sk5),nil),X1) != sk5
| nil = sk1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_46]) ).
cnf(c_0_52,negated_conjecture,
( nil = sk1
| app(cons(sk6(sk5),nil),sk7(sk5)) = sk5 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_36]),c_0_37])]) ).
cnf(c_0_53,negated_conjecture,
( ssList(sk7(sk5))
| nil = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_36]),c_0_37])]) ).
cnf(c_0_54,negated_conjecture,
( nil != sk2
| ~ equalelemsP(sk1)
| app(sk1,X1) != sk2
| ~ ssList(X1)
| ssItem(sk6(X1)) ),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_55,negated_conjecture,
( nil != sk2
| ~ equalelemsP(sk1)
| app(sk1,X1) != sk2
| ~ ssList(X1)
| ssList(sk7(X1)) ),
inference(fof_simplification,[status(thm)],[co1_18]) ).
cnf(c_0_56,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_57,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
inference(fof_simplification,[status(thm)],[clause157]) ).
cnf(c_0_58,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_59,negated_conjecture,
( nil != sk2
| ~ equalelemsP(sk1)
| app(sk1,X1) != sk2
| ~ ssList(X1)
| app(cons(sk6(X1),nil),sk7(X1)) = X1 ),
c_0_49 ).
cnf(c_0_60,negated_conjecture,
( nil != sk1
| nil = sk4 ),
inference(rw,[status(thm)],[c_0_50,c_0_22]) ).
cnf(c_0_61,negated_conjecture,
nil = sk1,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]) ).
cnf(c_0_62,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_63,negated_conjecture,
( nil != sk2
| ~ equalelemsP(sk1)
| app(sk1,X1) != sk2
| ~ ssList(X1)
| ssItem(sk6(X1)) ),
c_0_54 ).
cnf(c_0_64,negated_conjecture,
( nil != sk2
| ~ equalelemsP(sk1)
| app(sk1,X1) != sk2
| ~ ssList(X1)
| ssList(sk7(X1)) ),
c_0_55 ).
cnf(c_0_65,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
c_0_56 ).
cnf(c_0_66,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
c_0_57 ).
cnf(c_0_67,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_58 ).
cnf(c_0_68,negated_conjecture,
( ~ ssList(X1)
| nil != sk4
| app(sk1,X1) != sk4
| app(cons(sk6(X1),nil),sk7(X1)) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_27]),c_0_27]),c_0_28])]) ).
cnf(c_0_69,negated_conjecture,
sk4 = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_61]),c_0_61])]) ).
cnf(c_0_70,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_62 ).
cnf(c_0_71,negated_conjecture,
( ~ ssList(X1)
| nil != sk4
| app(sk1,X1) != sk4
| ssItem(sk6(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_27]),c_0_27]),c_0_28])]) ).
cnf(c_0_72,negated_conjecture,
( ~ ssList(X1)
| nil != sk4
| app(sk1,X1) != sk4
| ssList(sk7(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_27]),c_0_27]),c_0_28])]) ).
cnf(c_0_73,plain,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1)
| app(cons(X1,X2),X3) != nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]) ).
cnf(c_0_74,negated_conjecture,
( ~ ssList(X1)
| app(sk1,X1) != sk1
| app(cons(sk6(X1),sk1),sk7(X1)) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_61]),c_0_61]),c_0_69]),c_0_69])]) ).
cnf(c_0_75,plain,
( ~ ssList(X1)
| app(X1,sk1) = X1 ),
inference(rw,[status(thm)],[c_0_70,c_0_61]) ).
cnf(c_0_76,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_77,negated_conjecture,
( ~ ssList(X1)
| app(sk1,X1) != sk1
| ssItem(sk6(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_61]),c_0_69]),c_0_69])]) ).
cnf(c_0_78,negated_conjecture,
( ~ ssList(X1)
| app(sk1,X1) != sk1
| ssList(sk7(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_61]),c_0_69]),c_0_69])]) ).
cnf(c_0_79,plain,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1)
| app(cons(X1,X2),X3) != sk1 ),
inference(rw,[status(thm)],[c_0_73,c_0_61]) ).
cnf(c_0_80,negated_conjecture,
app(cons(sk6(sk1),sk1),sk7(sk1)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76])]) ).
cnf(c_0_81,negated_conjecture,
ssItem(sk6(sk1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_75]),c_0_76])]) ).
cnf(c_0_82,negated_conjecture,
ssList(sk7(sk1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_75]),c_0_76])]) ).
cnf(c_0_83,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_81]),c_0_82]),c_0_76])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC327-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.10/0.35 % Computer : n018.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 08:17:58 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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.62/0.51 % Version: 3.5.1
% 0.62/0.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.62/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.62/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.62/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.62/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.62/0.51 % Starting sh5l with 300s (1) cores
% 0.62/0.51 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1424583 completed with status 0
% 0.62/0.51 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.62/0.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.62/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.62/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.62/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.62/0.51 % No SInE strategy applied
% 0.62/0.51 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.62/0.51 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.62/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.62/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.62/0.51 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.62/0.51 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.62/0.51 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.62/0.51 % G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 1424595 completed with status 0
% 0.62/0.51 % Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 0.62/0.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.62/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.62/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.62/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.62/0.51 % No SInE strategy applied
% 0.62/0.51 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.62/0.51 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.62/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.62/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.62/0.51 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.62/0.51 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.62/0.51 % Preprocessing time : 0.004 s
% 0.62/0.51
% 0.62/0.51 % Proof found!
% 0.62/0.51 % SZS status Unsatisfiable
% 0.62/0.51 % SZS output start CNFRefutation
% See solution above
% 0.62/0.51 % Parsed axioms : 206
% 0.62/0.51 % Removed by relevancy pruning/SinE : 0
% 0.62/0.51 % Initial clauses : 206
% 0.62/0.51 % Removed in clause preprocessing : 0
% 0.62/0.51 % Initial clauses in saturation : 206
% 0.62/0.51 % Processed clauses : 406
% 0.62/0.51 % ...of these trivial : 15
% 0.62/0.51 % ...subsumed : 72
% 0.62/0.51 % ...remaining for further processing : 319
% 0.62/0.51 % Other redundant clauses eliminated : 108
% 0.62/0.51 % Clauses deleted for lack of memory : 0
% 0.62/0.51 % Backward-subsumed : 0
% 0.62/0.51 % Backward-rewritten : 102
% 0.62/0.51 % Generated clauses : 1037
% 0.62/0.51 % ...of the previous two non-redundant : 902
% 0.62/0.51 % ...aggressively subsumed : 0
% 0.62/0.51 % Contextual simplify-reflections : 17
% 0.62/0.51 % Paramodulations : 925
% 0.62/0.51 % Factorizations : 0
% 0.62/0.51 % NegExts : 0
% 0.62/0.51 % Equation resolutions : 113
% 0.62/0.51 % Disequality decompositions : 0
% 0.62/0.51 % Total rewrite steps : 1174
% 0.62/0.51 % ...of those cached : 1079
% 0.62/0.51 % Propositional unsat checks : 0
% 0.62/0.51 % Propositional check models : 0
% 0.62/0.51 % Propositional check unsatisfiable : 0
% 0.62/0.51 % Propositional clauses : 0
% 0.62/0.51 % Propositional clauses after purity: 0
% 0.62/0.51 % Propositional unsat core size : 0
% 0.62/0.51 % Propositional preprocessing time : 0.000
% 0.62/0.51 % Propositional encoding time : 0.000
% 0.62/0.51 % Propositional solver time : 0.000
% 0.62/0.51 % Success case prop preproc time : 0.000
% 0.62/0.51 % Success case prop encoding time : 0.000
% 0.62/0.51 % Success case prop solver time : 0.000
% 0.62/0.51 % Current number of processed clauses : 194
% 0.62/0.51 % Positive orientable unit clauses : 67
% 0.62/0.51 % Positive unorientable unit clauses: 0
% 0.62/0.51 % Negative unit clauses : 2
% 0.62/0.51 % Non-unit-clauses : 125
% 0.62/0.51 % Current number of unprocessed clauses: 648
% 0.62/0.51 % ...number of literals in the above : 3408
% 0.62/0.51 % Current number of archived formulas : 0
% 0.62/0.51 % Current number of archived clauses : 102
% 0.62/0.51 % Clause-clause subsumption calls (NU) : 9454
% 0.62/0.51 % Rec. Clause-clause subsumption calls : 1629
% 0.62/0.51 % Non-unit clause-clause subsumptions : 58
% 0.62/0.51 % Unit Clause-clause subsumption calls : 251
% 0.62/0.51 % Rewrite failures with RHS unbound : 0
% 0.62/0.51 % BW rewrite match attempts : 6
% 0.62/0.51 % BW rewrite match successes : 6
% 0.62/0.51 % Condensation attempts : 0
% 0.62/0.51 % Condensation successes : 0
% 0.62/0.51 % Termbank termtop insertions : 27693
% 0.62/0.51 % Search garbage collected termcells : 579
% 0.62/0.51
% 0.62/0.51 % -------------------------------------------------
% 0.62/0.51 % User time : 0.058 s
% 0.62/0.51 % System time : 0.006 s
% 0.62/0.51 % Total time : 0.064 s
% 0.62/0.51 % Maximum resident set size: 4076 pages
% 0.62/0.51
% 0.62/0.51 % -------------------------------------------------
% 0.62/0.51 % User time : 0.290 s
% 0.62/0.51 % System time : 0.038 s
% 0.62/0.51 % Total time : 0.328 s
% 0.62/0.51 % Maximum resident set size: 4864 pages
% 0.62/0.51 % E exiting
%------------------------------------------------------------------------------