TSTP Solution File: SWC169-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC169-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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 : Tue May 21 04:24:02 EDT 2024
% Result : Unsatisfiable 0.21s 0.58s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 24
% Syntax : Number of clauses : 85 ( 33 unt; 10 nHn; 83 RR)
% Number of literals : 204 ( 53 equ; 118 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 88 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_12,negated_conjecture,
~ neq(sk5,sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(clause102,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause102) ).
cnf(clause143,axiom,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause143) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(co1_7,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_8,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_11,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_10,negated_conjecture,
ssList(sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_9,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(clause179,axiom,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(clause157,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause157) ).
cnf(clause65,axiom,
( duplicatefreeP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause65) ).
cnf(co1_17,negated_conjecture,
( cons(sk9,nil) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_14,negated_conjecture,
( ssItem(sk9)
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(clause131,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause131) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause119,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause50) ).
cnf(clause2,axiom,
duplicatefreeP(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause2) ).
cnf(c_0_24,negated_conjecture,
~ neq(sk5,sk6),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_25,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
inference(fof_simplification,[status(thm)],[clause102]) ).
cnf(c_0_26,plain,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause143]) ).
cnf(c_0_27,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_28,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause149]) ).
cnf(c_0_29,negated_conjecture,
~ neq(sk5,sk6),
c_0_24 ).
cnf(c_0_30,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
c_0_25 ).
cnf(c_0_31,negated_conjecture,
ssItem(sk5),
co1_7 ).
cnf(c_0_32,negated_conjecture,
ssItem(sk6),
co1_8 ).
cnf(c_0_33,plain,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_26 ).
cnf(c_0_34,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_27 ).
cnf(c_0_35,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
co1_11 ).
cnf(c_0_36,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_28 ).
cnf(c_0_37,negated_conjecture,
ssList(sk8),
co1_10 ).
cnf(c_0_38,negated_conjecture,
sk6 = sk5,
inference(cn,[status(thm)],[inference(rw,[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_39,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_40,plain,
( rearsegP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_33]),c_0_34]) ).
cnf(c_0_41,negated_conjecture,
( app(app(sk7,cons(sk5,nil)),app(cons(sk5,nil),sk8)) = sk1
| ~ ssList(app(sk7,cons(sk5,nil)))
| ~ ssList(cons(sk5,nil)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]),c_0_38]),c_0_38]) ).
cnf(c_0_42,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_39 ).
cnf(c_0_43,axiom,
ssList(nil),
clause8 ).
cnf(c_0_44,negated_conjecture,
( rearsegP(sk1,sk8)
| ~ ssList(app(app(sk7,cons(sk5,nil)),cons(sk5,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_35]),c_0_37]),c_0_38])]) ).
cnf(c_0_45,negated_conjecture,
( app(app(sk7,cons(sk5,nil)),app(cons(sk5,nil),sk8)) = sk1
| ~ ssList(app(sk7,cons(sk5,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_31]),c_0_43])]) ).
cnf(c_0_46,negated_conjecture,
ssList(sk7),
co1_9 ).
cnf(c_0_47,negated_conjecture,
( rearsegP(sk1,sk8)
| ~ ssList(app(sk7,cons(sk5,nil)))
| ~ ssList(cons(sk5,nil)) ),
inference(spm,[status(thm)],[c_0_44,c_0_34]) ).
cnf(c_0_48,plain,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
inference(fof_simplification,[status(thm)],[clause179]) ).
cnf(c_0_49,negated_conjecture,
( app(app(sk7,cons(sk5,nil)),app(cons(sk5,nil),sk8)) = sk1
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_34]),c_0_46])]) ).
cnf(c_0_50,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause157]) ).
cnf(c_0_51,negated_conjecture,
( rearsegP(sk1,sk8)
| ~ ssList(app(sk7,cons(sk5,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_42]),c_0_31]),c_0_43])]) ).
cnf(c_0_52,plain,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
c_0_48 ).
cnf(c_0_53,negated_conjecture,
app(app(sk7,cons(sk5,nil)),app(cons(sk5,nil),sk8)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_42]),c_0_31]),c_0_43])]) ).
cnf(c_0_54,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_50 ).
cnf(c_0_55,plain,
( duplicatefreeP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause65]) ).
cnf(c_0_56,negated_conjecture,
( cons(sk9,nil) = sk3
| nil = sk3 ),
co1_17 ).
cnf(c_0_57,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_58,negated_conjecture,
( ssItem(sk9)
| nil = sk3 ),
co1_14 ).
cnf(c_0_59,plain,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause131]) ).
cnf(c_0_60,negated_conjecture,
( rearsegP(sk1,sk8)
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_34]),c_0_46])]) ).
cnf(c_0_61,plain,
( ~ ssItem(X1)
| ~ ssList(app(app(X2,cons(X1,X3)),cons(X1,X4)))
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ duplicatefreeP(app(app(X2,cons(X1,X3)),cons(X1,X4))) ),
inference(er,[status(thm)],[c_0_52]) ).
cnf(c_0_62,negated_conjecture,
app(app(sk7,cons(sk5,nil)),cons(sk5,app(nil,sk8))) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_31]),c_0_37]),c_0_43])]) ).
cnf(c_0_63,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_64,plain,
( duplicatefreeP(cons(X1,nil))
| ~ ssItem(X1) ),
c_0_55 ).
cnf(c_0_65,negated_conjecture,
( cons(sk9,nil) = sk1
| nil = sk1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_57]),c_0_57]) ).
cnf(c_0_66,negated_conjecture,
( nil = sk1
| ssItem(sk9) ),
inference(rw,[status(thm)],[c_0_58,c_0_57]) ).
cnf(c_0_67,plain,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause119]) ).
cnf(c_0_68,plain,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_59 ).
cnf(c_0_69,negated_conjecture,
rearsegP(sk1,sk8),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_42]),c_0_31]),c_0_43])]) ).
cnf(c_0_70,negated_conjecture,
( ~ ssList(app(nil,sk8))
| ~ duplicatefreeP(sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_31]),c_0_63]),c_0_43]),c_0_46])]) ).
cnf(c_0_71,negated_conjecture,
( nil = sk1
| duplicatefreeP(sk1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]) ).
cnf(c_0_72,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_73,plain,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_67 ).
cnf(c_0_74,negated_conjecture,
app(skaf46(sk1,sk8),sk8) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_37]),c_0_63])]) ).
cnf(c_0_75,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_76,negated_conjecture,
( nil = sk1
| ~ ssList(app(nil,sk8)) ),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_77,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
c_0_72 ).
cnf(c_0_78,negated_conjecture,
( sk8 = nil
| nil != sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_37]),c_0_75])]) ).
cnf(c_0_79,negated_conjecture,
nil = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_37])]) ).
cnf(c_0_80,axiom,
duplicatefreeP(nil),
clause2 ).
cnf(c_0_81,negated_conjecture,
sk8 = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_79]),c_0_79])]) ).
cnf(c_0_82,plain,
duplicatefreeP(sk1),
inference(rw,[status(thm)],[c_0_80,c_0_79]) ).
cnf(c_0_83,negated_conjecture,
~ ssList(app(sk1,sk1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_79]),c_0_81]),c_0_82])]) ).
cnf(c_0_84,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_34]),c_0_63])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC169-1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n003.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.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Sun May 19 02:45:52 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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.21/0.58 # Version: 3.1.0
% 0.21/0.58 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.58 # Starting sh5l with 300s (1) cores
% 0.21/0.58 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 30866 completed with status 0
% 0.21/0.58 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.21/0.58 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.58 # No SInE strategy applied
% 0.21/0.58 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.21/0.58 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.58 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.21/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.21/0.58 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.21/0.58 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.21/0.58 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 0.21/0.58 # G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 30874 completed with status 0
% 0.21/0.58 # Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 0.21/0.58 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.58 # No SInE strategy applied
% 0.21/0.58 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.21/0.58 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.58 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.21/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.21/0.58 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.21/0.58 # Preprocessing time : 0.003 s
% 0.21/0.58
% 0.21/0.58 # Proof found!
% 0.21/0.58 # SZS status Unsatisfiable
% 0.21/0.58 # SZS output start CNFRefutation
% See solution above
% 0.21/0.58 # Parsed axioms : 203
% 0.21/0.58 # Removed by relevancy pruning/SinE : 0
% 0.21/0.58 # Initial clauses : 203
% 0.21/0.58 # Removed in clause preprocessing : 0
% 0.21/0.58 # Initial clauses in saturation : 203
% 0.21/0.58 # Processed clauses : 578
% 0.21/0.58 # ...of these trivial : 9
% 0.21/0.58 # ...subsumed : 103
% 0.21/0.58 # ...remaining for further processing : 466
% 0.21/0.58 # Other redundant clauses eliminated : 65
% 0.21/0.58 # Clauses deleted for lack of memory : 0
% 0.21/0.58 # Backward-subsumed : 14
% 0.21/0.58 # Backward-rewritten : 231
% 0.21/0.58 # Generated clauses : 1740
% 0.21/0.58 # ...of the previous two non-redundant : 1696
% 0.21/0.58 # ...aggressively subsumed : 0
% 0.21/0.58 # Contextual simplify-reflections : 46
% 0.21/0.58 # Paramodulations : 1671
% 0.21/0.58 # Factorizations : 0
% 0.21/0.58 # NegExts : 0
% 0.21/0.58 # Equation resolutions : 70
% 0.21/0.58 # Disequality decompositions : 0
% 0.21/0.58 # Total rewrite steps : 2190
% 0.21/0.58 # ...of those cached : 2074
% 0.21/0.58 # Propositional unsat checks : 0
% 0.21/0.58 # Propositional check models : 0
% 0.21/0.58 # Propositional check unsatisfiable : 0
% 0.21/0.58 # Propositional clauses : 0
% 0.21/0.58 # Propositional clauses after purity: 0
% 0.21/0.58 # Propositional unsat core size : 0
% 0.21/0.58 # Propositional preprocessing time : 0.000
% 0.21/0.58 # Propositional encoding time : 0.000
% 0.21/0.58 # Propositional solver time : 0.000
% 0.21/0.58 # Success case prop preproc time : 0.000
% 0.21/0.58 # Success case prop encoding time : 0.000
% 0.21/0.58 # Success case prop solver time : 0.000
% 0.21/0.58 # Current number of processed clauses : 198
% 0.21/0.58 # Positive orientable unit clauses : 70
% 0.21/0.58 # Positive unorientable unit clauses: 0
% 0.21/0.58 # Negative unit clauses : 5
% 0.21/0.58 # Non-unit-clauses : 123
% 0.21/0.58 # Current number of unprocessed clauses: 1305
% 0.21/0.58 # ...number of literals in the above : 6267
% 0.21/0.58 # Current number of archived formulas : 0
% 0.21/0.58 # Current number of archived clauses : 245
% 0.21/0.58 # Clause-clause subsumption calls (NU) : 12350
% 0.21/0.58 # Rec. Clause-clause subsumption calls : 4494
% 0.21/0.58 # Non-unit clause-clause subsumptions : 156
% 0.21/0.58 # Unit Clause-clause subsumption calls : 536
% 0.21/0.58 # Rewrite failures with RHS unbound : 0
% 0.21/0.58 # BW rewrite match attempts : 44
% 0.21/0.58 # BW rewrite match successes : 27
% 0.21/0.58 # Condensation attempts : 0
% 0.21/0.58 # Condensation successes : 0
% 0.21/0.58 # Termbank termtop insertions : 41404
% 0.21/0.58 # Search garbage collected termcells : 529
% 0.21/0.58
% 0.21/0.58 # -------------------------------------------------
% 0.21/0.58 # User time : 0.064 s
% 0.21/0.58 # System time : 0.007 s
% 0.21/0.58 # Total time : 0.071 s
% 0.21/0.58 # Maximum resident set size: 2140 pages
% 0.21/0.58
% 0.21/0.58 # -------------------------------------------------
% 0.21/0.58 # User time : 0.310 s
% 0.21/0.58 # System time : 0.029 s
% 0.21/0.58 # Total time : 0.340 s
% 0.21/0.58 # Maximum resident set size: 1876 pages
% 0.21/0.58 % E---3.1 exiting
% 0.21/0.58 % E exiting
%------------------------------------------------------------------------------