TSTP Solution File: LCL127-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL127-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:38 EDT 2023
% Result : Unsatisfiable 24.84s 3.82s
% Output : CNFRefutation 24.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 47
% Number of leaves : 3
% Syntax : Number of clauses : 69 ( 15 unt; 0 nHn; 45 RR)
% Number of literals : 188 ( 0 equ; 144 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 242 ( 45 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.u1ImVY478n/E---3.1_27123.p',condensed_detachment) ).
cnf(s_2,axiom,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X1,equivalent(equivalent(X2,X4),equivalent(X3,X4))))),
file('/export/starexec/sandbox2/tmp/tmp.u1ImVY478n/E---3.1_27123.p',s_2) ).
cnf(prove_lg_2,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))),
file('/export/starexec/sandbox2/tmp/tmp.u1ImVY478n/E---3.1_27123.p',prove_lg_2) ).
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(equivalent(X1,equivalent(X2,X3)),equivalent(X1,equivalent(equivalent(X2,X4),equivalent(X3,X4))))),
s_2 ).
cnf(c_0_5,plain,
( is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X4,X3))))
| ~ is_a_theorem(equivalent(X1,equivalent(X2,X4))) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X2)))
| ~ is_a_theorem(equivalent(X4,equivalent(X1,X3)))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_3,c_0_5]) ).
cnf(c_0_7,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X3,equivalent(X4,X1)))
| ~ is_a_theorem(equivalent(X4,X2))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_6]) ).
cnf(c_0_8,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,equivalent(X3,X4)))
| ~ is_a_theorem(equivalent(X3,X1))
| ~ is_a_theorem(X4)
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_3,c_0_7]) ).
cnf(c_0_9,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,X3),equivalent(X4,X3)))
| ~ is_a_theorem(equivalent(X5,equivalent(X2,X4)))
| ~ is_a_theorem(equivalent(X5,X1)) ),
inference(spm,[status(thm)],[c_0_8,c_0_4]) ).
cnf(c_0_10,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,equivalent(X3,X4)))
| ~ is_a_theorem(equivalent(X5,equivalent(X3,X4)))
| ~ is_a_theorem(equivalent(X2,X1))
| ~ is_a_theorem(X5) ),
inference(spm,[status(thm)],[c_0_9,c_0_6]) ).
cnf(c_0_11,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,equivalent(X3,equivalent(equivalent(X4,X5),equivalent(X6,X5)))))
| ~ is_a_theorem(equivalent(equivalent(X3,equivalent(X4,X6)),X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_4]) ).
cnf(c_0_12,plain,
( is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X4,X3))))
| ~ is_a_theorem(equivalent(X5,equivalent(X1,equivalent(equivalent(X2,X6),equivalent(X4,X6)))))
| ~ is_a_theorem(X5) ),
inference(spm,[status(thm)],[c_0_11,c_0_4]) ).
cnf(c_0_13,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X2)))
| ~ is_a_theorem(equivalent(X4,equivalent(X5,equivalent(equivalent(X1,X6),equivalent(X3,X6)))))
| ~ is_a_theorem(X5)
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_3,c_0_12]) ).
cnf(c_0_14,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X3,equivalent(X4,equivalent(equivalent(X5,X6),equivalent(X1,X6)))))
| ~ is_a_theorem(equivalent(X5,X2))
| ~ is_a_theorem(X4)
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_13]) ).
cnf(c_0_15,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,equivalent(X3,equivalent(equivalent(X4,X5),equivalent(X6,X5)))))
| ~ is_a_theorem(equivalent(X4,X1))
| ~ is_a_theorem(X6)
| ~ is_a_theorem(X3)
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_3,c_0_14]) ).
cnf(c_0_16,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,equivalent(X3,equivalent(X4,X5))))
| ~ is_a_theorem(equivalent(X3,equivalent(X6,X5)))
| ~ is_a_theorem(equivalent(X4,X1))
| ~ is_a_theorem(X6)
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_5]) ).
cnf(c_0_17,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,equivalent(X3,equivalent(X4,X5))))
| ~ is_a_theorem(equivalent(equivalent(X6,X5),X1))
| ~ is_a_theorem(equivalent(X2,equivalent(X6,X4)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_16,c_0_4]) ).
cnf(c_0_18,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,equivalent(X3,X4)),equivalent(X5,equivalent(X3,X6))))
| ~ is_a_theorem(equivalent(equivalent(X5,equivalent(X4,X6)),X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_4]) ).
cnf(c_0_19,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,equivalent(X3,X3)),X1))
| ~ is_a_theorem(equivalent(X4,equivalent(X5,X2)))
| ~ is_a_theorem(X5)
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_18,c_0_6]) ).
cnf(c_0_20,plain,
( is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X2,X3))))
| ~ is_a_theorem(equivalent(X4,equivalent(X5,X1)))
| ~ is_a_theorem(X5)
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_19,c_0_4]) ).
cnf(c_0_21,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X2)))
| ~ is_a_theorem(equivalent(X3,equivalent(X4,X5)))
| ~ is_a_theorem(X5)
| ~ is_a_theorem(X4)
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_20]) ).
cnf(c_0_22,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X2)))
| ~ is_a_theorem(equivalent(X3,equivalent(X4,X5)))
| ~ is_a_theorem(equivalent(X4,X6))
| ~ is_a_theorem(X5)
| ~ is_a_theorem(X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_6]),c_0_8]) ).
cnf(c_0_23,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X2)))
| ~ is_a_theorem(equivalent(X3,equivalent(equivalent(X4,equivalent(X5,X6)),X7)))
| ~ is_a_theorem(X7)
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_22,c_0_4]) ).
cnf(c_0_24,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(equivalent(X3,X4),equivalent(X5,X4)),X2)))
| ~ is_a_theorem(equivalent(X1,equivalent(X3,X5))) ),
inference(spm,[status(thm)],[c_0_6,c_0_4]) ).
cnf(c_0_25,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X2)))
| ~ is_a_theorem(equivalent(X3,equivalent(X4,X5)))
| ~ is_a_theorem(equivalent(X3,X6))
| ~ is_a_theorem(X6) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X2)))
| ~ is_a_theorem(equivalent(equivalent(X3,equivalent(X4,X5)),X6))
| ~ is_a_theorem(X6) ),
inference(spm,[status(thm)],[c_0_25,c_0_4]) ).
cnf(c_0_27,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))),
prove_lg_2 ).
cnf(c_0_28,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X2)))
| ~ is_a_theorem(equivalent(X3,equivalent(equivalent(X4,X5),equivalent(X6,X5)))) ),
inference(spm,[status(thm)],[c_0_26,c_0_4]) ).
cnf(c_0_29,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e))))))
| ~ is_a_theorem(equivalent(X2,equivalent(X1,a)))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_7]) ).
cnf(c_0_30,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X2))),
inference(spm,[status(thm)],[c_0_28,c_0_4]) ).
cnf(c_0_31,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e))))))
| ~ is_a_theorem(equivalent(X2,equivalent(X3,X4)))
| ~ is_a_theorem(equivalent(X1,a))
| ~ is_a_theorem(equivalent(X2,X5))
| ~ is_a_theorem(X5) ),
inference(spm,[status(thm)],[c_0_29,c_0_25]) ).
cnf(c_0_32,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,equivalent(X3,X3)),X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e))))))
| ~ is_a_theorem(equivalent(equivalent(X2,equivalent(X3,X4)),X5))
| ~ is_a_theorem(equivalent(X1,a))
| ~ is_a_theorem(X5) ),
inference(spm,[status(thm)],[c_0_31,c_0_4]) ).
cnf(c_0_34,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X2)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e))))))
| ~ is_a_theorem(equivalent(X2,equivalent(equivalent(X3,X4),equivalent(X5,X4))))
| ~ is_a_theorem(equivalent(X1,a)) ),
inference(spm,[status(thm)],[c_0_33,c_0_4]) ).
cnf(c_0_36,plain,
( is_a_theorem(equivalent(X1,X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_3,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e))))))
| ~ is_a_theorem(equivalent(X1,a)) ),
inference(spm,[status(thm)],[c_0_35,c_0_4]) ).
cnf(c_0_38,plain,
is_a_theorem(equivalent(X1,X1)),
inference(spm,[status(thm)],[c_0_36,c_0_4]) ).
cnf(c_0_39,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))),a))
| ~ is_a_theorem(equivalent(X2,equivalent(X1,a)))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_37,c_0_6]) ).
cnf(c_0_40,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X3,equivalent(X2,X1)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_7,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))),a))
| ~ is_a_theorem(equivalent(X1,a)) ),
inference(spm,[status(thm)],[c_0_39,c_0_30]) ).
cnf(c_0_42,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X2,X1)) ),
inference(spm,[status(thm)],[c_0_40,c_0_38]) ).
cnf(c_0_43,negated_conjecture,
( ~ is_a_theorem(equivalent(a,equivalent(X1,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e))))))
| ~ is_a_theorem(equivalent(X1,a)) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_44,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(b,e),equivalent(c,e))),a))
| ~ is_a_theorem(equivalent(a,equivalent(X1,equivalent(b,c)))) ),
inference(spm,[status(thm)],[c_0_43,c_0_5]) ).
cnf(c_0_45,negated_conjecture,
( ~ is_a_theorem(equivalent(a,equivalent(X1,equivalent(equivalent(b,e),equivalent(c,e)))))
| ~ is_a_theorem(equivalent(a,equivalent(X1,equivalent(b,c)))) ),
inference(spm,[status(thm)],[c_0_44,c_0_42]) ).
cnf(c_0_46,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(X3,X4),equivalent(X5,X4)))))
| ~ is_a_theorem(equivalent(X6,equivalent(equivalent(X2,equivalent(X3,X5)),X1)))
| ~ is_a_theorem(X6) ),
inference(spm,[status(thm)],[c_0_7,c_0_4]) ).
cnf(c_0_47,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X2)))
| ~ is_a_theorem(equivalent(X1,X3)) ),
inference(spm,[status(thm)],[c_0_6,c_0_30]) ).
cnf(c_0_48,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(b,c)),a)))
| ~ is_a_theorem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_40]) ).
cnf(c_0_49,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X2)))
| ~ is_a_theorem(equivalent(X3,X1)) ),
inference(spm,[status(thm)],[c_0_42,c_0_47]) ).
cnf(c_0_50,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,equivalent(b,c)),X2))
| ~ is_a_theorem(equivalent(X2,a)) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_51,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(b,X2),equivalent(c,X2))),a)),
inference(spm,[status(thm)],[c_0_50,c_0_4]) ).
cnf(c_0_52,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),X4))
| ~ is_a_theorem(equivalent(X5,equivalent(X1,X3)))
| ~ is_a_theorem(equivalent(X5,X4)) ),
inference(spm,[status(thm)],[c_0_7,c_0_4]) ).
cnf(c_0_53,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(X2,equivalent(b,X3))))
| ~ is_a_theorem(equivalent(X1,a)) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_54,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,equivalent(b,X2)),X3))
| ~ is_a_theorem(equivalent(X3,a)) ),
inference(spm,[status(thm)],[c_0_53,c_0_42]) ).
cnf(c_0_55,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(b,X2),equivalent(X3,X2))),a)),
inference(spm,[status(thm)],[c_0_54,c_0_4]) ).
cnf(c_0_56,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,X1))
| ~ is_a_theorem(equivalent(X2,X3))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_8,c_0_38]) ).
cnf(c_0_57,plain,
( is_a_theorem(equivalent(equivalent(X1,X1),X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_42,c_0_34]) ).
cnf(c_0_58,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(X1,equivalent(equivalent(b,X2),equivalent(X3,X2))))),
inference(spm,[status(thm)],[c_0_55,c_0_42]) ).
cnf(c_0_59,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,X2),X1))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_60,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(b,X3)),a)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_58,c_0_46]) ).
cnf(c_0_61,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,X2),X1)) ),
inference(spm,[status(thm)],[c_0_59,c_0_4]) ).
cnf(c_0_62,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(b,X2)),a),X3))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_60,c_0_42]) ).
cnf(c_0_63,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),equivalent(X2,X3)))),
inference(spm,[status(thm)],[c_0_61,c_0_4]) ).
cnf(c_0_64,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(b,X2)),X3),equivalent(a,X3))),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_65,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,X1),equivalent(equivalent(X2,equivalent(b,X3)),X1))),
inference(spm,[status(thm)],[c_0_64,c_0_42]) ).
cnf(c_0_66,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,equivalent(X1,equivalent(b,X2))),equivalent(X3,X1))),
inference(spm,[status(thm)],[c_0_65,c_0_5]) ).
cnf(c_0_67,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(X1,X2),equivalent(a,equivalent(X2,equivalent(b,X3))))),
inference(spm,[status(thm)],[c_0_66,c_0_42]) ).
cnf(c_0_68,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_67,c_0_4]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : LCL127-1 : TPTP v8.1.2. Released v1.0.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 2400
% 0.11/0.30 % WCLimit : 300
% 0.11/0.30 % DateTime : Mon Oct 2 12:19:34 EDT 2023
% 0.11/0.31 % CPUTime :
% 0.15/0.39 Running first-order theorem proving
% 0.15/0.40 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.u1ImVY478n/E---3.1_27123.p
% 24.84/3.82 # Version: 3.1pre001
% 24.84/3.82 # Preprocessing class: FSSSSMSSSSSNFFN.
% 24.84/3.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 24.84/3.82 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 24.84/3.82 # Starting new_bool_3 with 300s (1) cores
% 24.84/3.82 # Starting new_bool_1 with 300s (1) cores
% 24.84/3.82 # Starting sh5l with 300s (1) cores
% 24.84/3.82 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 27225 completed with status 0
% 24.84/3.82 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 24.84/3.82 # Preprocessing class: FSSSSMSSSSSNFFN.
% 24.84/3.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 24.84/3.82 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 24.84/3.82 # No SInE strategy applied
% 24.84/3.82 # Search class: FHUNF-FFSF22-MFFFFFNN
% 24.84/3.82 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 24.84/3.82 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 811s (1) cores
% 24.84/3.82 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 24.84/3.82 # Starting new_bool_3 with 136s (1) cores
% 24.84/3.82 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 24.84/3.82 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S00 with 136s (1) cores
% 24.84/3.82 # G-E--_208_C18_F1_SE_CS_SP_PS_S00 with pid 27236 completed with status 0
% 24.84/3.82 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S00
% 24.84/3.82 # Preprocessing class: FSSSSMSSSSSNFFN.
% 24.84/3.82 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 24.84/3.82 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 24.84/3.82 # No SInE strategy applied
% 24.84/3.82 # Search class: FHUNF-FFSF22-MFFFFFNN
% 24.84/3.82 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 24.84/3.82 # Starting G-E--_060_C18_F1_PI_AE_Q4_CS_SP_S0Y with 811s (1) cores
% 24.84/3.82 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 24.84/3.82 # Starting new_bool_3 with 136s (1) cores
% 24.84/3.82 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 24.84/3.82 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S00 with 136s (1) cores
% 24.84/3.82 # Preprocessing time : 0.001 s
% 24.84/3.82 # Presaturation interreduction done
% 24.84/3.82
% 24.84/3.82 # Proof found!
% 24.84/3.82 # SZS status Unsatisfiable
% 24.84/3.82 # SZS output start CNFRefutation
% See solution above
% 24.84/3.82 # Parsed axioms : 3
% 24.84/3.82 # Removed by relevancy pruning/SinE : 0
% 24.84/3.82 # Initial clauses : 3
% 24.84/3.82 # Removed in clause preprocessing : 0
% 24.84/3.82 # Initial clauses in saturation : 3
% 24.84/3.82 # Processed clauses : 2654
% 24.84/3.82 # ...of these trivial : 0
% 24.84/3.82 # ...subsumed : 1792
% 24.84/3.82 # ...remaining for further processing : 862
% 24.84/3.82 # Other redundant clauses eliminated : 0
% 24.84/3.82 # Clauses deleted for lack of memory : 0
% 24.84/3.82 # Backward-subsumed : 411
% 24.84/3.82 # Backward-rewritten : 1
% 24.84/3.82 # Generated clauses : 136028
% 24.84/3.82 # ...of the previous two non-redundant : 135534
% 24.84/3.82 # ...aggressively subsumed : 0
% 24.84/3.82 # Contextual simplify-reflections : 4
% 24.84/3.82 # Paramodulations : 136028
% 24.84/3.82 # Factorizations : 0
% 24.84/3.82 # NegExts : 0
% 24.84/3.82 # Equation resolutions : 0
% 24.84/3.82 # Total rewrite steps : 1765
% 24.84/3.82 # Propositional unsat checks : 0
% 24.84/3.82 # Propositional check models : 0
% 24.84/3.82 # Propositional check unsatisfiable : 0
% 24.84/3.82 # Propositional clauses : 0
% 24.84/3.82 # Propositional clauses after purity: 0
% 24.84/3.82 # Propositional unsat core size : 0
% 24.84/3.82 # Propositional preprocessing time : 0.000
% 24.84/3.82 # Propositional encoding time : 0.000
% 24.84/3.82 # Propositional solver time : 0.000
% 24.84/3.82 # Success case prop preproc time : 0.000
% 24.84/3.82 # Success case prop encoding time : 0.000
% 24.84/3.82 # Success case prop solver time : 0.000
% 24.84/3.82 # Current number of processed clauses : 447
% 24.84/3.82 # Positive orientable unit clauses : 4
% 24.84/3.82 # Positive unorientable unit clauses: 0
% 24.84/3.82 # Negative unit clauses : 36
% 24.84/3.82 # Non-unit-clauses : 407
% 24.84/3.82 # Current number of unprocessed clauses: 132405
% 24.84/3.82 # ...number of literals in the above : 1012096
% 24.84/3.82 # Current number of archived formulas : 0
% 24.84/3.82 # Current number of archived clauses : 415
% 24.84/3.82 # Clause-clause subsumption calls (NU) : 241147
% 24.84/3.82 # Rec. Clause-clause subsumption calls : 46910
% 24.84/3.82 # Non-unit clause-clause subsumptions : 1403
% 24.84/3.82 # Unit Clause-clause subsumption calls : 7766
% 24.84/3.82 # Rewrite failures with RHS unbound : 0
% 24.84/3.82 # BW rewrite match attempts : 592
% 24.84/3.82 # BW rewrite match successes : 4
% 24.84/3.82 # Condensation attempts : 0
% 24.84/3.82 # Condensation successes : 0
% 24.84/3.82 # Termbank termtop insertions : 3857553
% 24.84/3.82
% 24.84/3.82 # -------------------------------------------------
% 24.84/3.82 # User time : 2.935 s
% 24.84/3.82 # System time : 0.074 s
% 24.84/3.82 # Total time : 3.009 s
% 24.84/3.82 # Maximum resident set size: 1576 pages
% 24.84/3.82
% 24.84/3.82 # -------------------------------------------------
% 24.84/3.82 # User time : 14.883 s
% 24.84/3.82 # System time : 0.404 s
% 24.84/3.82 # Total time : 15.287 s
% 24.84/3.82 # Maximum resident set size: 1672 pages
% 24.84/3.82 % E---3.1 exiting
% 24.84/3.82 % E---3.1 exiting
%------------------------------------------------------------------------------