TSTP Solution File: LCL119-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL119-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:11:37 EDT 2023
% Result : Unsatisfiable 31.45s 4.55s
% Output : CNFRefutation 31.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 38
% Number of leaves : 3
% Syntax : Number of clauses : 82 ( 36 unt; 0 nHn; 36 RR)
% Number of literals : 144 ( 0 equ; 64 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 240 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.RodGmRcSdJ/E---3.1_11475.p',condensed_detachment) ).
cnf(xgj,axiom,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,X1)),equivalent(X2,X3)))),
file('/export/starexec/sandbox2/tmp/tmp.RodGmRcSdJ/E---3.1_11475.p',xgj) ).
cnf(prove_wo,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,equivalent(b,c)),equivalent(c,equivalent(b,a)))),
file('/export/starexec/sandbox2/tmp/tmp.RodGmRcSdJ/E---3.1_11475.p',prove_wo) ).
cnf(c_0_3,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
condensed_detachment ).
cnf(c_0_4,axiom,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,X1)),equivalent(X2,X3)))),
xgj ).
cnf(c_0_5,plain,
( is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X1,X2)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X1,equivalent(X2,X3)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_5]) ).
cnf(c_0_7,plain,
( is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),X1))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_8,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X1,equivalent(X2,X3)))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_7]) ).
cnf(c_0_9,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,equivalent(X3,X1)))
| ~ is_a_theorem(equivalent(X2,X3)) ),
inference(spm,[status(thm)],[c_0_8,c_0_4]) ).
cnf(c_0_10,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X3,equivalent(X1,equivalent(X2,X3)))) ),
inference(spm,[status(thm)],[c_0_9,c_0_4]) ).
cnf(c_0_11,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X2)),X1)),
inference(spm,[status(thm)],[c_0_10,c_0_4]) ).
cnf(c_0_12,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X3,X1))))
| ~ is_a_theorem(equivalent(X2,X3)) ),
inference(spm,[status(thm)],[c_0_6,c_0_4]) ).
cnf(c_0_13,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X1,equivalent(X2,X2))) ),
inference(spm,[status(thm)],[c_0_3,c_0_11]) ).
cnf(c_0_14,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X3,X1))
| ~ is_a_theorem(equivalent(X2,X3)) ),
inference(spm,[status(thm)],[c_0_6,c_0_12]) ).
cnf(c_0_15,plain,
is_a_theorem(equivalent(equivalent(X1,X1),equivalent(X2,X2))),
inference(spm,[status(thm)],[c_0_13,c_0_11]) ).
cnf(c_0_16,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X2,equivalent(X1,equivalent(X3,X3)))) ),
inference(spm,[status(thm)],[c_0_14,c_0_11]) ).
cnf(c_0_17,plain,
is_a_theorem(equivalent(X1,X1)),
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_18,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X1,X2)),X2)),
inference(spm,[status(thm)],[c_0_16,c_0_4]) ).
cnf(c_0_19,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X2,X1)) ),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_20,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_12]) ).
cnf(c_0_21,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,X2),X1)) ),
inference(spm,[status(thm)],[c_0_9,c_0_15]) ).
cnf(c_0_22,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,equivalent(X2,equivalent(X3,X1))),X3)) ),
inference(spm,[status(thm)],[c_0_9,c_0_18]) ).
cnf(c_0_23,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(X3,X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,equivalent(X3,X3))),equivalent(X1,X2))),
inference(spm,[status(thm)],[c_0_21,c_0_4]) ).
cnf(c_0_25,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,equivalent(X3,X1)))
| ~ is_a_theorem(equivalent(X3,X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(X3,equivalent(X1,equivalent(X2,equivalent(X4,X4))))) ),
inference(spm,[status(thm)],[c_0_14,c_0_24]) ).
cnf(c_0_27,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X2,equivalent(X3,equivalent(X3,X1)))) ),
inference(spm,[status(thm)],[c_0_14,c_0_18]) ).
cnf(c_0_28,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_17]) ).
cnf(c_0_29,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),X3)) ),
inference(spm,[status(thm)],[c_0_25,c_0_4]) ).
cnf(c_0_30,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(equivalent(X2,X2),X3)),X1),X3)),
inference(spm,[status(thm)],[c_0_26,c_0_4]) ).
cnf(c_0_31,plain,
( is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X2,X1)),X3)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X2,X1)))),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_33,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_20]) ).
cnf(c_0_34,plain,
is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X2,equivalent(X3,equivalent(X3,X1)))))),
inference(spm,[status(thm)],[c_0_27,c_0_18]) ).
cnf(c_0_35,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X3),X2)),X1)),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X3,equivalent(X3,X2)),X1)) ),
inference(spm,[status(thm)],[c_0_27,c_0_31]) ).
cnf(c_0_37,plain,
( is_a_theorem(equivalent(equivalent(X1,equivalent(X1,X2)),X3))
| ~ is_a_theorem(equivalent(X3,X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_32]) ).
cnf(c_0_38,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,equivalent(X3,X1)),equivalent(X2,X3))) ),
inference(spm,[status(thm)],[c_0_33,c_0_4]) ).
cnf(c_0_39,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X2,X3))))
| ~ is_a_theorem(equivalent(X3,X1)) ),
inference(spm,[status(thm)],[c_0_9,c_0_34]) ).
cnf(c_0_40,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X3),X2))) ),
inference(spm,[status(thm)],[c_0_3,c_0_35]) ).
cnf(c_0_41,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,equivalent(X3,equivalent(X3,X4)))),equivalent(X1,X2)),X4)),
inference(spm,[status(thm)],[c_0_36,c_0_4]) ).
cnf(c_0_42,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(equivalent(X2,X1),X3),X2))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_9,c_0_28]) ).
cnf(c_0_43,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X1,X2)),X3)),
inference(spm,[status(thm)],[c_0_19,c_0_4]) ).
cnf(c_0_44,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X2,X3))))
| ~ is_a_theorem(equivalent(X1,X3)) ),
inference(spm,[status(thm)],[c_0_19,c_0_37]) ).
cnf(c_0_45,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,equivalent(X3,equivalent(equivalent(X3,X2),X1)))) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_46,plain,
is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X3,equivalent(X3,equivalent(equivalent(X4,X4),equivalent(X1,X2))))))),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_47,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,X1),X3))
| ~ is_a_theorem(equivalent(X2,X3)) ),
inference(spm,[status(thm)],[c_0_42,c_0_37]) ).
cnf(c_0_48,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,equivalent(X4,equivalent(X4,X1)))),equivalent(X2,X3)))),
inference(spm,[status(thm)],[c_0_27,c_0_43]) ).
cnf(c_0_49,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X2,X3))
| ~ is_a_theorem(equivalent(X1,X3)) ),
inference(spm,[status(thm)],[c_0_6,c_0_44]) ).
cnf(c_0_50,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X3),equivalent(X2,X1)))),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_51,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X2),X3)),X3)) ),
inference(spm,[status(thm)],[c_0_47,c_0_30]) ).
cnf(c_0_52,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(equivalent(X2,X2),equivalent(X3,equivalent(X3,X4)))),X1),X4)),
inference(spm,[status(thm)],[c_0_26,c_0_48]) ).
cnf(c_0_53,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(X1,equivalent(equivalent(X4,X4),equivalent(X3,X2)))) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_54,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X1),X2),equivalent(equivalent(X3,X3),equivalent(X4,equivalent(X4,X2))))),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_55,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X1),X2),equivalent(equivalent(X3,X2),X3))),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_56,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X1),equivalent(equivalent(X3,X3),X2))),
inference(spm,[status(thm)],[c_0_19,c_0_55]) ).
cnf(c_0_57,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),X1),equivalent(X3,X2))),
inference(spm,[status(thm)],[c_0_53,c_0_56]) ).
cnf(c_0_58,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(equivalent(X3,X1),X3)),X2))),
inference(spm,[status(thm)],[c_0_27,c_0_57]) ).
cnf(c_0_59,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X2),X3)),X1)),
inference(spm,[status(thm)],[c_0_10,c_0_58]) ).
cnf(c_0_60,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X2,equivalent(X2,X1)),X3),equivalent(equivalent(X4,X3),X4)))),
inference(spm,[status(thm)],[c_0_27,c_0_59]) ).
cnf(c_0_61,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,equivalent(X2,X1))) ),
inference(spm,[status(thm)],[c_0_3,c_0_18]) ).
cnf(c_0_62,plain,
( is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X2),X3)))
| ~ is_a_theorem(equivalent(X1,equivalent(equivalent(X4,X3),X4))) ),
inference(spm,[status(thm)],[c_0_49,c_0_55]) ).
cnf(c_0_63,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X1,X2)),X3),equivalent(X2,X3))),
inference(spm,[status(thm)],[c_0_10,c_0_60]) ).
cnf(c_0_64,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(equivalent(X2,equivalent(X2,X3)),X1),X3)) ),
inference(spm,[status(thm)],[c_0_61,c_0_37]) ).
cnf(c_0_65,plain,
( is_a_theorem(equivalent(equivalent(X1,equivalent(X1,equivalent(X2,X3))),X2))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_6,c_0_18]) ).
cnf(c_0_66,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X1,equivalent(X2,X3))),X2),equivalent(equivalent(X4,X4),X3))),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_67,plain,
( is_a_theorem(equivalent(equivalent(X1,equivalent(X1,X2)),equivalent(X2,X3)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_68,plain,
( is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X2),X3)))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X4,X1),X3),X4)) ),
inference(spm,[status(thm)],[c_0_62,c_0_12]) ).
cnf(c_0_69,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X1,equivalent(X2,equivalent(X3,X4)))),X2),equivalent(X4,X3))),
inference(spm,[status(thm)],[c_0_53,c_0_66]) ).
cnf(c_0_70,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,equivalent(X3,X1))))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_67]) ).
cnf(c_0_71,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,equivalent(X2,X1))),equivalent(equivalent(X4,X4),X3))),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_72,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X2,X3),X1))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_9,c_0_70]) ).
cnf(c_0_73,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X4),equivalent(X2,X1))),equivalent(X4,X3))),
inference(spm,[status(thm)],[c_0_53,c_0_71]) ).
cnf(c_0_74,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X4)))
| ~ is_a_theorem(equivalent(equivalent(X2,X1),equivalent(X4,X3))) ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_75,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X4),equivalent(X3,equivalent(X4,equivalent(X2,X1)))))),
inference(spm,[status(thm)],[c_0_74,c_0_4]) ).
cnf(c_0_76,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X4)))
| ~ is_a_theorem(equivalent(X3,equivalent(X4,equivalent(X2,X1)))) ),
inference(spm,[status(thm)],[c_0_6,c_0_75]) ).
cnf(c_0_77,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,equivalent(X2,equivalent(X1,X3))))),
inference(spm,[status(thm)],[c_0_76,c_0_4]) ).
cnf(c_0_78,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(X1,X3),X2))),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_79,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,equivalent(b,c)),equivalent(c,equivalent(b,a)))),
prove_wo ).
cnf(c_0_80,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X3,equivalent(X2,X1)))),
inference(spm,[status(thm)],[c_0_74,c_0_78]) ).
cnf(c_0_81,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_80])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LCL119-1 : TPTP v8.1.2. Released v1.0.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n019.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Oct 2 13:00:36 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.RodGmRcSdJ/E---3.1_11475.p
% 31.45/4.55 # Version: 3.1pre001
% 31.45/4.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 31.45/4.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 31.45/4.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 31.45/4.55 # Starting new_bool_3 with 300s (1) cores
% 31.45/4.55 # Starting new_bool_1 with 300s (1) cores
% 31.45/4.55 # Starting sh5l with 300s (1) cores
% 31.45/4.55 # new_bool_3 with pid 11554 completed with status 0
% 31.45/4.55 # Result found by new_bool_3
% 31.45/4.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 31.45/4.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 31.45/4.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 31.45/4.55 # Starting new_bool_3 with 300s (1) cores
% 31.45/4.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 31.45/4.55 # Search class: FHUNF-FFSF22-MFFFFFNN
% 31.45/4.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 31.45/4.55 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 181s (1) cores
% 31.45/4.55 # G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 11558 completed with status 0
% 31.45/4.55 # Result found by G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 31.45/4.55 # Preprocessing class: FSSSSMSSSSSNFFN.
% 31.45/4.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 31.45/4.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 31.45/4.55 # Starting new_bool_3 with 300s (1) cores
% 31.45/4.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 31.45/4.55 # Search class: FHUNF-FFSF22-MFFFFFNN
% 31.45/4.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 31.45/4.55 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 181s (1) cores
% 31.45/4.55 # Preprocessing time : 0.001 s
% 31.45/4.55
% 31.45/4.55 # Proof found!
% 31.45/4.55 # SZS status Unsatisfiable
% 31.45/4.55 # SZS output start CNFRefutation
% See solution above
% 31.45/4.55 # Parsed axioms : 3
% 31.45/4.55 # Removed by relevancy pruning/SinE : 0
% 31.45/4.55 # Initial clauses : 3
% 31.45/4.55 # Removed in clause preprocessing : 0
% 31.45/4.55 # Initial clauses in saturation : 3
% 31.45/4.55 # Processed clauses : 62653
% 31.45/4.55 # ...of these trivial : 18946
% 31.45/4.55 # ...subsumed : 41561
% 31.45/4.55 # ...remaining for further processing : 2146
% 31.45/4.55 # Other redundant clauses eliminated : 0
% 31.45/4.55 # Clauses deleted for lack of memory : 0
% 31.45/4.55 # Backward-subsumed : 0
% 31.45/4.55 # Backward-rewritten : 1
% 31.45/4.55 # Generated clauses : 586898
% 31.45/4.55 # ...of the previous two non-redundant : 381282
% 31.45/4.55 # ...aggressively subsumed : 0
% 31.45/4.55 # Contextual simplify-reflections : 0
% 31.45/4.55 # Paramodulations : 586898
% 31.45/4.55 # Factorizations : 0
% 31.45/4.55 # NegExts : 0
% 31.45/4.55 # Equation resolutions : 0
% 31.45/4.55 # Total rewrite steps : 241180
% 31.45/4.55 # Propositional unsat checks : 0
% 31.45/4.55 # Propositional check models : 0
% 31.45/4.55 # Propositional check unsatisfiable : 0
% 31.45/4.55 # Propositional clauses : 0
% 31.45/4.55 # Propositional clauses after purity: 0
% 31.45/4.55 # Propositional unsat core size : 0
% 31.45/4.55 # Propositional preprocessing time : 0.000
% 31.45/4.55 # Propositional encoding time : 0.000
% 31.45/4.55 # Propositional solver time : 0.000
% 31.45/4.55 # Success case prop preproc time : 0.000
% 31.45/4.55 # Success case prop encoding time : 0.000
% 31.45/4.55 # Success case prop solver time : 0.000
% 31.45/4.55 # Current number of processed clauses : 2145
% 31.45/4.55 # Positive orientable unit clauses : 1361
% 31.45/4.55 # Positive unorientable unit clauses: 0
% 31.45/4.55 # Negative unit clauses : 0
% 31.45/4.55 # Non-unit-clauses : 784
% 31.45/4.55 # Current number of unprocessed clauses: 318632
% 31.45/4.55 # ...number of literals in the above : 433058
% 31.45/4.55 # Current number of archived formulas : 0
% 31.45/4.55 # Current number of archived clauses : 1
% 31.45/4.55 # Clause-clause subsumption calls (NU) : 1636015
% 31.45/4.55 # Rec. Clause-clause subsumption calls : 1635627
% 31.45/4.55 # Non-unit clause-clause subsumptions : 41561
% 31.45/4.55 # Unit Clause-clause subsumption calls : 23
% 31.45/4.55 # Rewrite failures with RHS unbound : 0
% 31.45/4.55 # BW rewrite match attempts : 756342
% 31.45/4.55 # BW rewrite match successes : 1
% 31.45/4.55 # Condensation attempts : 0
% 31.45/4.55 # Condensation successes : 0
% 31.45/4.55 # Termbank termtop insertions : 6959867
% 31.45/4.55
% 31.45/4.55 # -------------------------------------------------
% 31.45/4.55 # User time : 3.675 s
% 31.45/4.55 # System time : 0.123 s
% 31.45/4.55 # Total time : 3.798 s
% 31.45/4.55 # Maximum resident set size: 1636 pages
% 31.45/4.55
% 31.45/4.55 # -------------------------------------------------
% 31.45/4.55 # User time : 3.675 s
% 31.45/4.55 # System time : 0.127 s
% 31.45/4.55 # Total time : 3.801 s
% 31.45/4.55 # Maximum resident set size: 1672 pages
% 31.45/4.55 % E---3.1 exiting
% 31.45/4.55 % E---3.1 exiting
%------------------------------------------------------------------------------