TSTP Solution File: LCL099-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL099-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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 18:23:43 EDT 2023
% Result : Unsatisfiable 259.38s 33.12s
% Output : CNFRefutation 259.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 4
% Syntax : Number of clauses : 68 ( 33 unt; 0 nHn; 36 RR)
% Number of literals : 111 ( 0 equ; 61 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 196 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.6WRtUyUVMu/E---3.1_5726.p',condensed_detachment) ).
cnf(lg_3,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),equivalent(equivalent(X2,X3),X4)),X5),X5)),
file('/export/starexec/sandbox/tmp/tmp.6WRtUyUVMu/E---3.1_5726.p',lg_3) ).
cnf(lg_2,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X4),X4)),
file('/export/starexec/sandbox/tmp/tmp.6WRtUyUVMu/E---3.1_5726.p',lg_2) ).
cnf(prove_lg_5,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,a),c)),equivalent(equivalent(e,a),falsehood)),equivalent(equivalent(equivalent(equivalent(a,b),e),c),falsehood))),
file('/export/starexec/sandbox/tmp/tmp.6WRtUyUVMu/E---3.1_5726.p',prove_lg_5) ).
cnf(c_0_4,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
condensed_detachment ).
cnf(c_0_5,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),equivalent(equivalent(X2,X3),X4)),X5),X5)),
lg_3 ).
cnf(c_0_6,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X4),X4)),
lg_2 ).
cnf(c_0_7,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X2,X3),equivalent(X2,X4)),X5),equivalent(equivalent(X3,X4),X5)),X1)) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_8,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X2,X3),equivalent(X2,X4)),equivalent(X3,X4)),X1)) ),
inference(spm,[status(thm)],[c_0_4,c_0_6]) ).
cnf(c_0_9,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X2))),
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_10,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3))),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X3,X1),equivalent(X3,X2))) ),
inference(spm,[status(thm)],[c_0_4,c_0_10]) ).
cnf(c_0_12,plain,
is_a_theorem(equivalent(X1,X1)),
inference(spm,[status(thm)],[c_0_11,c_0_9]) ).
cnf(c_0_13,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(X4,X2),equivalent(equivalent(X1,X4),X3)))),
inference(spm,[status(thm)],[c_0_7,c_0_5]) ).
cnf(c_0_14,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),equivalent(equivalent(X2,X3),X4))),
inference(spm,[status(thm)],[c_0_7,c_0_12]) ).
cnf(c_0_15,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),X4)))
| ~ is_a_theorem(equivalent(equivalent(X3,X2),X4)) ),
inference(spm,[status(thm)],[c_0_4,c_0_13]) ).
cnf(c_0_16,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X4,X1),equivalent(X4,X2)),X3)) ),
inference(spm,[status(thm)],[c_0_4,c_0_14]) ).
cnf(c_0_17,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(equivalent(X1,X4),X3))
| ~ is_a_theorem(equivalent(X2,X4)) ),
inference(spm,[status(thm)],[c_0_4,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,a),c)),equivalent(equivalent(e,a),falsehood)),equivalent(equivalent(equivalent(equivalent(a,b),e),c),falsehood))),
prove_lg_5 ).
cnf(c_0_19,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X4,X1),X5),X3))
| ~ is_a_theorem(equivalent(equivalent(X4,X2),X5)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(a,equivalent(equivalent(b,a),c))),X2),equivalent(equivalent(equivalent(equivalent(a,b),e),c),falsehood)))
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(e,a),falsehood)),X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X3)))
| ~ is_a_theorem(equivalent(X2,X3)) ),
inference(spm,[status(thm)],[c_0_17,c_0_12]) ).
cnf(c_0_22,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(a,equivalent(equivalent(b,a),c))),equivalent(X1,equivalent(equivalent(e,a),falsehood))),equivalent(equivalent(equivalent(equivalent(a,b),e),c),falsehood))),
inference(spm,[status(thm)],[c_0_20,c_0_12]) ).
cnf(c_0_23,plain,
( is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),X5))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X2,X3),X4),X5)) ),
inference(spm,[status(thm)],[c_0_7,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(equivalent(b,a),c)),equivalent(equivalent(a,X1),equivalent(equivalent(e,a),falsehood))),equivalent(equivalent(equivalent(equivalent(a,b),e),c),falsehood))),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,plain,
( is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),equivalent(equivalent(X2,X3),X5)))
| ~ is_a_theorem(equivalent(X4,X5)) ),
inference(spm,[status(thm)],[c_0_17,c_0_14]) ).
cnf(c_0_26,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,a),equivalent(equivalent(a,b),e))),equivalent(equivalent(e,a),falsehood)),falsehood)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X2),X1))),
inference(spm,[status(thm)],[c_0_11,c_0_13]) ).
cnf(c_0_28,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(a,equivalent(equivalent(b,a),equivalent(equivalent(a,b),e)))),X2),falsehood))
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(e,a),falsehood)),X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_19]) ).
cnf(c_0_29,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X3),equivalent(equivalent(X4,X1),equivalent(X4,X2))))),
inference(spm,[status(thm)],[c_0_16,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(a,equivalent(equivalent(b,a),equivalent(equivalent(a,b),e)))),equivalent(X1,equivalent(equivalent(e,a),falsehood))),falsehood)),
inference(spm,[status(thm)],[c_0_28,c_0_12]) ).
cnf(c_0_31,plain,
( is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X4),X5))
| ~ is_a_theorem(equivalent(X4,X5)) ),
inference(spm,[status(thm)],[c_0_17,c_0_6]) ).
cnf(c_0_32,plain,
( is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X2,X4))),X5))
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(X3,X4)),X5)) ),
inference(spm,[status(thm)],[c_0_8,c_0_15]) ).
cnf(c_0_33,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,X3)),equivalent(X2,X1)))),
inference(spm,[status(thm)],[c_0_11,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,a),equivalent(X1,equivalent(equivalent(b,a),equivalent(equivalent(a,b),e)))),equivalent(equivalent(e,a),falsehood)),falsehood)),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4))
| ~ is_a_theorem(equivalent(equivalent(X5,equivalent(X2,X3)),equivalent(X5,X4))) ),
inference(spm,[status(thm)],[c_0_11,c_0_32]) ).
cnf(c_0_36,plain,
( is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X2)),equivalent(X1,X3)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_4,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(e,equivalent(equivalent(b,a),equivalent(equivalent(a,b),e))),falsehood)),equivalent(X1,falsehood))),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,plain,
( is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X4))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_7,c_0_36]) ).
cnf(c_0_39,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(e,equivalent(equivalent(b,a),equivalent(equivalent(a,b),e)))),equivalent(X1,falsehood)),falsehood)),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_40,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X2,X3),equivalent(X2,X4)),X5),X1))
| ~ is_a_theorem(equivalent(equivalent(X3,X4),X5)) ),
inference(spm,[status(thm)],[c_0_8,c_0_17]) ).
cnf(c_0_41,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(equivalent(X4,X1),equivalent(X4,X2)),X3))),
inference(spm,[status(thm)],[c_0_16,c_0_6]) ).
cnf(c_0_42,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(equivalent(b,a),equivalent(equivalent(a,b),e))),equivalent(equivalent(e,X1),falsehood)),falsehood)),
inference(spm,[status(thm)],[c_0_39,c_0_23]) ).
cnf(c_0_43,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X2,equivalent(X3,X4)),equivalent(X2,X5)),equivalent(equivalent(equivalent(X6,X3),equivalent(X6,X4)),X5)),X1)) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(equivalent(a,b),e)),equivalent(equivalent(e,equivalent(equivalent(b,a),X1)),falsehood)),falsehood)),
inference(spm,[status(thm)],[c_0_42,c_0_23]) ).
cnf(c_0_45,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X1),X2),X2)),
inference(spm,[status(thm)],[c_0_43,c_0_10]) ).
cnf(c_0_46,plain,
( is_a_theorem(equivalent(equivalent(X1,X1),X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_4,c_0_27]) ).
cnf(c_0_47,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(equivalent(X2,X3),equivalent(X2,X3)),X1)) ),
inference(spm,[status(thm)],[c_0_7,c_0_31]) ).
cnf(c_0_48,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4))
| ~ is_a_theorem(equivalent(equivalent(X2,X3),X4)) ),
inference(spm,[status(thm)],[c_0_8,c_0_21]) ).
cnf(c_0_49,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(equivalent(a,b),e)),X2),falsehood))
| ~ is_a_theorem(equivalent(equivalent(equivalent(e,equivalent(equivalent(b,a),X1)),falsehood),X2)) ),
inference(spm,[status(thm)],[c_0_44,c_0_17]) ).
cnf(c_0_50,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),X4))
| ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X5,X1),equivalent(X5,X2)),X3),X4)) ),
inference(spm,[status(thm)],[c_0_19,c_0_6]) ).
cnf(c_0_51,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X2)),equivalent(X1,X3)),X3)),
inference(spm,[status(thm)],[c_0_35,c_0_45]) ).
cnf(c_0_52,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(X2,X1))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_17,c_0_46]) ).
cnf(c_0_53,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,X2),X1)) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_54,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(equivalent(e,equivalent(equivalent(b,a),X1)),falsehood),equivalent(X1,X2)))
| ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),e),X2),falsehood)) ),
inference(spm,[status(thm)],[c_0_49,c_0_48]) ).
cnf(c_0_55,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X1),X3)),X3)),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_56,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X1,X3))
| ~ is_a_theorem(equivalent(X3,X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_52]) ).
cnf(c_0_57,plain,
is_a_theorem(equivalent(equivalent(X1,X1),equivalent(X2,X2))),
inference(spm,[status(thm)],[c_0_53,c_0_27]) ).
cnf(c_0_58,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X3,X4),equivalent(X3,X2)))
| ~ is_a_theorem(equivalent(X1,X4)) ),
inference(spm,[status(thm)],[c_0_11,c_0_17]) ).
cnf(c_0_59,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(e,equivalent(equivalent(b,a),X1)),falsehood),equivalent(X1,equivalent(equivalent(e,equivalent(a,b)),falsehood)))),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_60,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X2)))
| ~ is_a_theorem(equivalent(X1,equivalent(X3,X3))) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_61,plain,
( is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X2),X3)))
| ~ is_a_theorem(equivalent(X1,X3)) ),
inference(spm,[status(thm)],[c_0_58,c_0_27]) ).
cnf(c_0_62,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(e,equivalent(equivalent(b,a),equivalent(equivalent(e,equivalent(a,b)),falsehood))),falsehood),equivalent(X1,X1))),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_63,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(X4,X2),X5)))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X1,X4),X3),X5)) ),
inference(spm,[status(thm)],[c_0_19,c_0_14]) ).
cnf(c_0_64,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X3,X3),X1),X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_61]) ).
cnf(c_0_65,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(e,X1),falsehood),equivalent(X1,equivalent(equivalent(b,a),equivalent(equivalent(e,equivalent(a,b)),falsehood))))),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_66,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X3,X2),X1)))),
inference(spm,[status(thm)],[c_0_64,c_0_13]) ).
cnf(c_0_67,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_65,c_0_66]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : LCL099-1 : TPTP v8.1.2. Released v1.0.0.
% 0.09/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n008.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon Oct 2 12:04:43 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.15/0.40 Running first-order model finding
% 0.15/0.40 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.6WRtUyUVMu/E---3.1_5726.p
% 259.38/33.12 # Version: 3.1pre001
% 259.38/33.12 # Preprocessing class: FSSSSMSSSSSNFFN.
% 259.38/33.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 259.38/33.12 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 259.38/33.12 # Starting new_bool_3 with 300s (1) cores
% 259.38/33.12 # Starting new_bool_1 with 300s (1) cores
% 259.38/33.12 # Starting sh5l with 300s (1) cores
% 259.38/33.12 # sh5l with pid 5806 completed with status 0
% 259.38/33.12 # Result found by sh5l
% 259.38/33.12 # Preprocessing class: FSSSSMSSSSSNFFN.
% 259.38/33.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 259.38/33.12 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 259.38/33.12 # Starting new_bool_3 with 300s (1) cores
% 259.38/33.12 # Starting new_bool_1 with 300s (1) cores
% 259.38/33.12 # Starting sh5l with 300s (1) cores
% 259.38/33.12 # SinE strategy is gf500_gu_R04_F100_L20000
% 259.38/33.12 # Search class: FHUNS-FFSF22-DFFFFFNN
% 259.38/33.12 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 259.38/33.12 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S3b with 181s (1) cores
% 259.38/33.12 # G-E--_208_C18_F1_SE_CS_SP_PS_S3b with pid 5812 completed with status 0
% 259.38/33.12 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S3b
% 259.38/33.12 # Preprocessing class: FSSSSMSSSSSNFFN.
% 259.38/33.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 259.38/33.12 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 259.38/33.12 # Starting new_bool_3 with 300s (1) cores
% 259.38/33.12 # Starting new_bool_1 with 300s (1) cores
% 259.38/33.12 # Starting sh5l with 300s (1) cores
% 259.38/33.12 # SinE strategy is gf500_gu_R04_F100_L20000
% 259.38/33.12 # Search class: FHUNS-FFSF22-DFFFFFNN
% 259.38/33.12 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 259.38/33.12 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S3b with 181s (1) cores
% 259.38/33.12 # Preprocessing time : 0.001 s
% 259.38/33.12 # Presaturation interreduction done
% 259.38/33.12
% 259.38/33.12 # Proof found!
% 259.38/33.12 # SZS status Unsatisfiable
% 259.38/33.12 # SZS output start CNFRefutation
% See solution above
% 259.38/33.12 # Parsed axioms : 4
% 259.38/33.12 # Removed by relevancy pruning/SinE : 0
% 259.38/33.12 # Initial clauses : 4
% 259.38/33.12 # Removed in clause preprocessing : 0
% 259.38/33.12 # Initial clauses in saturation : 4
% 259.38/33.12 # Processed clauses : 15975
% 259.38/33.12 # ...of these trivial : 54
% 259.38/33.12 # ...subsumed : 11260
% 259.38/33.12 # ...remaining for further processing : 4661
% 259.38/33.12 # Other redundant clauses eliminated : 0
% 259.38/33.12 # Clauses deleted for lack of memory : 0
% 259.38/33.12 # Backward-subsumed : 110
% 259.38/33.12 # Backward-rewritten : 1
% 259.38/33.12 # Generated clauses : 1105230
% 259.38/33.12 # ...of the previous two non-redundant : 1099857
% 259.38/33.12 # ...aggressively subsumed : 0
% 259.38/33.12 # Contextual simplify-reflections : 0
% 259.38/33.12 # Paramodulations : 1105230
% 259.38/33.12 # Factorizations : 0
% 259.38/33.12 # NegExts : 0
% 259.38/33.12 # Equation resolutions : 0
% 259.38/33.12 # Total rewrite steps : 13830
% 259.38/33.12 # Propositional unsat checks : 0
% 259.38/33.12 # Propositional check models : 0
% 259.38/33.12 # Propositional check unsatisfiable : 0
% 259.38/33.12 # Propositional clauses : 0
% 259.38/33.12 # Propositional clauses after purity: 0
% 259.38/33.12 # Propositional unsat core size : 0
% 259.38/33.12 # Propositional preprocessing time : 0.000
% 259.38/33.12 # Propositional encoding time : 0.000
% 259.38/33.12 # Propositional solver time : 0.000
% 259.38/33.12 # Success case prop preproc time : 0.000
% 259.38/33.12 # Success case prop encoding time : 0.000
% 259.38/33.12 # Success case prop solver time : 0.000
% 259.38/33.12 # Current number of processed clauses : 4546
% 259.38/33.12 # Positive orientable unit clauses : 95
% 259.38/33.12 # Positive unorientable unit clauses: 0
% 259.38/33.12 # Negative unit clauses : 308
% 259.38/33.12 # Non-unit-clauses : 4143
% 259.38/33.12 # Current number of unprocessed clauses: 1083818
% 259.38/33.12 # ...number of literals in the above : 4584969
% 259.38/33.12 # Current number of archived formulas : 0
% 259.38/33.12 # Current number of archived clauses : 115
% 259.38/33.12 # Clause-clause subsumption calls (NU) : 7510647
% 259.38/33.12 # Rec. Clause-clause subsumption calls : 2661266
% 259.38/33.12 # Non-unit clause-clause subsumptions : 9569
% 259.38/33.12 # Unit Clause-clause subsumption calls : 194018
% 259.38/33.12 # Rewrite failures with RHS unbound : 0
% 259.38/33.12 # BW rewrite match attempts : 83532
% 259.38/33.12 # BW rewrite match successes : 1
% 259.38/33.12 # Condensation attempts : 0
% 259.38/33.12 # Condensation successes : 0
% 259.38/33.12 # Termbank termtop insertions : 32133558
% 259.38/33.12
% 259.38/33.12 # -------------------------------------------------
% 259.38/33.12 # User time : 31.717 s
% 259.38/33.12 # System time : 0.735 s
% 259.38/33.12 # Total time : 32.452 s
% 259.38/33.12 # Maximum resident set size: 1644 pages
% 259.38/33.12
% 259.38/33.12 # -------------------------------------------------
% 259.38/33.12 # User time : 31.717 s
% 259.38/33.12 # System time : 0.739 s
% 259.38/33.12 # Total time : 32.456 s
% 259.38/33.12 # Maximum resident set size: 1676 pages
% 259.38/33.12 % E---3.1 exiting
%------------------------------------------------------------------------------