TSTP Solution File: FLD028-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : FLD028-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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 17:30:00 EDT 2023
% Result : Unsatisfiable 18.37s 2.79s
% Output : CNFRefutation 18.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 16
% Syntax : Number of clauses : 86 ( 36 unt; 11 nHn; 86 RR)
% Number of literals : 179 ( 0 equ; 86 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 81 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(compatibility_of_equality_and_multiplication,axiom,
( equalish(multiply(X1,X2),multiply(X3,X2))
| ~ defined(X2)
| ~ equalish(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.Q0Jeeob4iL/E---3.1_1225.p',compatibility_of_equality_and_multiplication) ).
cnf(existence_of_inverse_multiplication,axiom,
( equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity)
| equalish(X1,additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.Q0Jeeob4iL/E---3.1_1225.p',existence_of_inverse_multiplication) ).
cnf(transitivity_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.Q0Jeeob4iL/E---3.1_1225.p',transitivity_of_equality) ).
cnf(associativity_multiplication,axiom,
( equalish(multiply(X1,multiply(X2,X3)),multiply(multiply(X1,X2),X3))
| ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.Q0Jeeob4iL/E---3.1_1225.p',associativity_multiplication) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/tmp/tmp.Q0Jeeob4iL/E---3.1_1225.p',a_is_defined) ).
cnf(existence_of_identity_multiplication,axiom,
( equalish(multiply(multiplicative_identity,X1),X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.Q0Jeeob4iL/E---3.1_1225.p',existence_of_identity_multiplication) ).
cnf(v_is_defined,hypothesis,
defined(v),
file('/export/starexec/sandbox2/tmp/tmp.Q0Jeeob4iL/E---3.1_1225.p',v_is_defined) ).
cnf(a_not_equal_to_additive_identity_5,negated_conjecture,
~ equalish(a,additive_identity),
file('/export/starexec/sandbox2/tmp/tmp.Q0Jeeob4iL/E---3.1_1225.p',a_not_equal_to_additive_identity_5) ).
cnf(well_definedness_of_multiplicative_inverse,axiom,
( defined(multiplicative_inverse(X1))
| equalish(X1,additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.Q0Jeeob4iL/E---3.1_1225.p',well_definedness_of_multiplicative_inverse) ).
cnf(u_is_defined,hypothesis,
defined(u),
file('/export/starexec/sandbox2/tmp/tmp.Q0Jeeob4iL/E---3.1_1225.p',u_is_defined) ).
cnf(symmetry_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.Q0Jeeob4iL/E---3.1_1225.p',symmetry_of_equality) ).
cnf(commutativity_multiplication,axiom,
( equalish(multiply(X1,X2),multiply(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.Q0Jeeob4iL/E---3.1_1225.p',commutativity_multiplication) ).
cnf(well_definedness_of_multiplication,axiom,
( defined(multiply(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.Q0Jeeob4iL/E---3.1_1225.p',well_definedness_of_multiplication) ).
cnf(multiply_equals_b_7,negated_conjecture,
equalish(multiply(a,v),b),
file('/export/starexec/sandbox2/tmp/tmp.Q0Jeeob4iL/E---3.1_1225.p',multiply_equals_b_7) ).
cnf(multiply_equals_b_6,negated_conjecture,
equalish(multiply(a,u),b),
file('/export/starexec/sandbox2/tmp/tmp.Q0Jeeob4iL/E---3.1_1225.p',multiply_equals_b_6) ).
cnf(u_not_equal_to_v_8,negated_conjecture,
~ equalish(u,v),
file('/export/starexec/sandbox2/tmp/tmp.Q0Jeeob4iL/E---3.1_1225.p',u_not_equal_to_v_8) ).
cnf(c_0_16,axiom,
( equalish(multiply(X1,X2),multiply(X3,X2))
| ~ defined(X2)
| ~ equalish(X1,X3) ),
compatibility_of_equality_and_multiplication ).
cnf(c_0_17,axiom,
( equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity)
| equalish(X1,additive_identity)
| ~ defined(X1) ),
existence_of_inverse_multiplication ).
cnf(c_0_18,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
transitivity_of_equality ).
cnf(c_0_19,plain,
( equalish(multiply(multiply(X1,multiplicative_inverse(X1)),X2),multiply(multiplicative_identity,X2))
| equalish(X1,additive_identity)
| ~ defined(X2)
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,axiom,
( equalish(multiply(X1,multiply(X2,X3)),multiply(multiply(X1,X2),X3))
| ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3) ),
associativity_multiplication ).
cnf(c_0_21,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_22,axiom,
( equalish(multiply(multiplicative_identity,X1),X1)
| ~ defined(X1) ),
existence_of_identity_multiplication ).
cnf(c_0_23,hypothesis,
defined(v),
v_is_defined ).
cnf(c_0_24,plain,
( equalish(X1,multiply(multiplicative_identity,X2))
| equalish(X3,additive_identity)
| ~ defined(X2)
| ~ defined(X3)
| ~ equalish(X1,multiply(multiply(X3,multiplicative_inverse(X3)),X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,hypothesis,
( equalish(multiply(a,multiply(X1,X2)),multiply(multiply(a,X1),X2))
| ~ defined(X2)
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
~ equalish(a,additive_identity),
a_not_equal_to_additive_identity_5 ).
cnf(c_0_27,hypothesis,
equalish(multiply(multiplicative_identity,v),v),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,hypothesis,
( equalish(multiply(a,multiply(multiplicative_inverse(a),X1)),multiply(multiplicative_identity,X1))
| ~ defined(multiplicative_inverse(a))
| ~ defined(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_21])]),c_0_26]) ).
cnf(c_0_29,axiom,
( defined(multiplicative_inverse(X1))
| equalish(X1,additive_identity)
| ~ defined(X1) ),
well_definedness_of_multiplicative_inverse ).
cnf(c_0_30,hypothesis,
( equalish(X1,v)
| ~ equalish(X1,multiply(multiplicative_identity,v)) ),
inference(spm,[status(thm)],[c_0_18,c_0_27]) ).
cnf(c_0_31,hypothesis,
( equalish(multiply(a,multiply(multiplicative_inverse(a),X1)),multiply(multiplicative_identity,X1))
| ~ defined(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_21])]),c_0_26]) ).
cnf(c_0_32,hypothesis,
defined(u),
u_is_defined ).
cnf(c_0_33,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
symmetry_of_equality ).
cnf(c_0_34,hypothesis,
equalish(multiply(a,multiply(multiplicative_inverse(a),v)),v),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_23])]) ).
cnf(c_0_35,hypothesis,
equalish(multiply(multiplicative_identity,u),u),
inference(spm,[status(thm)],[c_0_22,c_0_32]) ).
cnf(c_0_36,axiom,
( equalish(multiply(X1,X2),multiply(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
commutativity_multiplication ).
cnf(c_0_37,plain,
( equalish(X1,multiply(multiply(X2,X3),X4))
| ~ defined(X4)
| ~ defined(X3)
| ~ defined(X2)
| ~ equalish(X1,multiply(X2,multiply(X3,X4))) ),
inference(spm,[status(thm)],[c_0_18,c_0_20]) ).
cnf(c_0_38,hypothesis,
equalish(v,multiply(a,multiply(multiplicative_inverse(a),v))),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,hypothesis,
( equalish(X1,u)
| ~ equalish(X1,multiply(multiplicative_identity,u)) ),
inference(spm,[status(thm)],[c_0_18,c_0_35]) ).
cnf(c_0_40,plain,
( equalish(multiply(multiply(X1,X2),X3),multiply(multiply(X2,X1),X3))
| ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_36]) ).
cnf(c_0_41,hypothesis,
( equalish(v,multiply(multiply(a,multiplicative_inverse(a)),v))
| ~ defined(multiplicative_inverse(a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_23]),c_0_21])]) ).
cnf(c_0_42,hypothesis,
equalish(multiply(a,multiply(multiplicative_inverse(a),u)),u),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_31]),c_0_32])]) ).
cnf(c_0_43,plain,
( equalish(X1,multiply(multiply(X2,X3),X4))
| ~ defined(X4)
| ~ defined(X2)
| ~ defined(X3)
| ~ equalish(X1,multiply(multiply(X3,X2),X4)) ),
inference(spm,[status(thm)],[c_0_18,c_0_40]) ).
cnf(c_0_44,hypothesis,
equalish(v,multiply(multiply(a,multiplicative_inverse(a)),v)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_29]),c_0_21])]),c_0_26]) ).
cnf(c_0_45,plain,
( equalish(X1,multiply(X2,X3))
| ~ defined(X2)
| ~ defined(X3)
| ~ equalish(X1,multiply(X3,X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_36]) ).
cnf(c_0_46,hypothesis,
equalish(u,multiply(a,multiply(multiplicative_inverse(a),u))),
inference(spm,[status(thm)],[c_0_33,c_0_42]) ).
cnf(c_0_47,hypothesis,
( equalish(v,multiply(multiply(multiplicative_inverse(a),a),v))
| ~ defined(multiplicative_inverse(a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_23]),c_0_21])]) ).
cnf(c_0_48,hypothesis,
( equalish(u,multiply(multiply(multiplicative_inverse(a),u),a))
| ~ defined(multiply(multiplicative_inverse(a),u)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_21])]) ).
cnf(c_0_49,axiom,
( defined(multiply(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
well_definedness_of_multiplication ).
cnf(c_0_50,hypothesis,
equalish(v,multiply(multiply(multiplicative_inverse(a),a),v)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_29]),c_0_21])]),c_0_26]) ).
cnf(c_0_51,hypothesis,
( equalish(u,multiply(multiply(multiplicative_inverse(a),u),a))
| ~ defined(multiplicative_inverse(a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_32])]) ).
cnf(c_0_52,hypothesis,
equalish(multiply(multiply(multiplicative_inverse(a),a),v),v),
inference(spm,[status(thm)],[c_0_33,c_0_50]) ).
cnf(c_0_53,hypothesis,
equalish(u,multiply(multiply(multiplicative_inverse(a),u),a)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_29]),c_0_21])]),c_0_26]) ).
cnf(c_0_54,hypothesis,
( equalish(X1,v)
| ~ equalish(X1,multiply(multiply(multiplicative_inverse(a),a),v)) ),
inference(spm,[status(thm)],[c_0_18,c_0_52]) ).
cnf(c_0_55,plain,
( equalish(multiply(multiplicative_inverse(X1),multiply(X2,X3)),multiply(multiply(multiplicative_inverse(X1),X2),X3))
| equalish(X1,additive_identity)
| ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_29]) ).
cnf(c_0_56,hypothesis,
equalish(multiply(multiply(multiplicative_inverse(a),u),a),u),
inference(spm,[status(thm)],[c_0_33,c_0_53]) ).
cnf(c_0_57,hypothesis,
equalish(multiply(multiplicative_inverse(a),multiply(a,v)),v),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_23]),c_0_21])]),c_0_26]) ).
cnf(c_0_58,hypothesis,
( equalish(X1,u)
| ~ equalish(X1,multiply(multiply(multiplicative_inverse(a),u),a)) ),
inference(spm,[status(thm)],[c_0_18,c_0_56]) ).
cnf(c_0_59,hypothesis,
( equalish(X1,v)
| ~ equalish(X1,multiply(multiplicative_inverse(a),multiply(a,v))) ),
inference(spm,[status(thm)],[c_0_18,c_0_57]) ).
cnf(c_0_60,plain,
( equalish(multiply(X1,multiplicative_inverse(X2)),multiply(multiplicative_inverse(X2),X1))
| equalish(X2,additive_identity)
| ~ defined(X1)
| ~ defined(X2) ),
inference(spm,[status(thm)],[c_0_36,c_0_29]) ).
cnf(c_0_61,negated_conjecture,
equalish(multiply(a,v),b),
multiply_equals_b_7 ).
cnf(c_0_62,hypothesis,
equalish(multiply(multiplicative_inverse(a),multiply(u,a)),u),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_55]),c_0_21]),c_0_32])]),c_0_26]) ).
cnf(c_0_63,hypothesis,
( equalish(multiply(multiply(a,v),multiplicative_inverse(a)),v)
| ~ defined(multiply(a,v)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_21])]),c_0_26]) ).
cnf(c_0_64,negated_conjecture,
equalish(b,multiply(a,v)),
inference(spm,[status(thm)],[c_0_33,c_0_61]) ).
cnf(c_0_65,hypothesis,
( equalish(X1,u)
| ~ equalish(X1,multiply(multiplicative_inverse(a),multiply(u,a))) ),
inference(spm,[status(thm)],[c_0_18,c_0_62]) ).
cnf(c_0_66,hypothesis,
equalish(multiply(multiply(a,v),multiplicative_inverse(a)),v),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_49]),c_0_23]),c_0_21])]) ).
cnf(c_0_67,negated_conjecture,
( equalish(multiply(b,X1),multiply(multiply(a,v),X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_64]) ).
cnf(c_0_68,hypothesis,
( equalish(multiply(multiply(u,a),multiplicative_inverse(a)),u)
| ~ defined(multiply(u,a)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_60]),c_0_21])]),c_0_26]) ).
cnf(c_0_69,hypothesis,
( equalish(X1,v)
| ~ equalish(X1,multiply(multiply(a,v),multiplicative_inverse(a))) ),
inference(spm,[status(thm)],[c_0_18,c_0_66]) ).
cnf(c_0_70,negated_conjecture,
( equalish(multiply(b,multiplicative_inverse(X1)),multiply(multiply(a,v),multiplicative_inverse(X1)))
| equalish(X1,additive_identity)
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_67,c_0_29]) ).
cnf(c_0_71,negated_conjecture,
equalish(multiply(a,u),b),
multiply_equals_b_6 ).
cnf(c_0_72,hypothesis,
equalish(multiply(multiply(u,a),multiplicative_inverse(a)),u),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_49]),c_0_21]),c_0_32])]) ).
cnf(c_0_73,hypothesis,
equalish(multiply(b,multiplicative_inverse(a)),v),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_21])]),c_0_26]) ).
cnf(c_0_74,negated_conjecture,
( equalish(multiply(multiply(a,u),X1),multiply(b,X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_71]) ).
cnf(c_0_75,hypothesis,
( equalish(X1,u)
| ~ equalish(X1,multiply(multiply(u,a),multiplicative_inverse(a))) ),
inference(spm,[status(thm)],[c_0_18,c_0_72]) ).
cnf(c_0_76,plain,
( equalish(multiply(multiply(X1,X2),multiplicative_inverse(X3)),multiply(multiply(X2,X1),multiplicative_inverse(X3)))
| equalish(X3,additive_identity)
| ~ defined(X2)
| ~ defined(X1)
| ~ defined(X3) ),
inference(spm,[status(thm)],[c_0_40,c_0_29]) ).
cnf(c_0_77,hypothesis,
( equalish(X1,v)
| ~ equalish(X1,multiply(b,multiplicative_inverse(a))) ),
inference(spm,[status(thm)],[c_0_18,c_0_73]) ).
cnf(c_0_78,negated_conjecture,
( equalish(multiply(multiply(a,u),multiplicative_inverse(X1)),multiply(b,multiplicative_inverse(X1)))
| equalish(X1,additive_identity)
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_74,c_0_29]) ).
cnf(c_0_79,hypothesis,
equalish(multiply(multiply(a,u),multiplicative_inverse(a)),u),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_32]),c_0_21])]),c_0_26]) ).
cnf(c_0_80,negated_conjecture,
equalish(multiply(multiply(a,u),multiplicative_inverse(a)),v),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_21])]),c_0_26]) ).
cnf(c_0_81,hypothesis,
( equalish(X1,u)
| ~ equalish(X1,multiply(multiply(a,u),multiplicative_inverse(a))) ),
inference(spm,[status(thm)],[c_0_18,c_0_79]) ).
cnf(c_0_82,negated_conjecture,
equalish(v,multiply(multiply(a,u),multiplicative_inverse(a))),
inference(spm,[status(thm)],[c_0_33,c_0_80]) ).
cnf(c_0_83,hypothesis,
equalish(v,u),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_84,negated_conjecture,
~ equalish(u,v),
u_not_equal_to_v_8 ).
cnf(c_0_85,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_83]),c_0_84]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : FLD028-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n010.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Oct 2 23:12:35 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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.Q0Jeeob4iL/E---3.1_1225.p
% 18.37/2.79 # Version: 3.1pre001
% 18.37/2.79 # Preprocessing class: FSMSSMSSSSSNFFN.
% 18.37/2.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.37/2.79 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 18.37/2.79 # Starting new_bool_3 with 300s (1) cores
% 18.37/2.79 # Starting new_bool_1 with 300s (1) cores
% 18.37/2.79 # Starting sh5l with 300s (1) cores
% 18.37/2.79 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1303 completed with status 0
% 18.37/2.79 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 18.37/2.79 # Preprocessing class: FSMSSMSSSSSNFFN.
% 18.37/2.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.37/2.79 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 18.37/2.79 # No SInE strategy applied
% 18.37/2.79 # Search class: FGUNF-FFMM21-SFFFFFNN
% 18.37/2.79 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 18.37/2.79 # Starting G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with 589s (1) cores
% 18.37/2.79 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 18.37/2.79 # Starting new_bool_3 with 269s (1) cores
% 18.37/2.79 # Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 18.37/2.79 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 18.37/2.79 # G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with pid 1312 completed with status 0
% 18.37/2.79 # Result found by G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN
% 18.37/2.79 # Preprocessing class: FSMSSMSSSSSNFFN.
% 18.37/2.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.37/2.79 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 18.37/2.79 # No SInE strategy applied
% 18.37/2.79 # Search class: FGUNF-FFMM21-SFFFFFNN
% 18.37/2.79 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 18.37/2.79 # Starting G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with 589s (1) cores
% 18.37/2.79 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 18.37/2.79 # Starting new_bool_3 with 269s (1) cores
% 18.37/2.79 # Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 18.37/2.79 # Preprocessing time : 0.001 s
% 18.37/2.79 # Presaturation interreduction done
% 18.37/2.79
% 18.37/2.79 # Proof found!
% 18.37/2.79 # SZS status Unsatisfiable
% 18.37/2.79 # SZS output start CNFRefutation
% See solution above
% 18.37/2.79 # Parsed axioms : 35
% 18.37/2.79 # Removed by relevancy pruning/SinE : 0
% 18.37/2.79 # Initial clauses : 35
% 18.37/2.79 # Removed in clause preprocessing : 0
% 18.37/2.79 # Initial clauses in saturation : 35
% 18.37/2.79 # Processed clauses : 14762
% 18.37/2.79 # ...of these trivial : 5080
% 18.37/2.79 # ...subsumed : 997
% 18.37/2.79 # ...remaining for further processing : 8685
% 18.37/2.79 # Other redundant clauses eliminated : 0
% 18.37/2.79 # Clauses deleted for lack of memory : 0
% 18.37/2.79 # Backward-subsumed : 5
% 18.37/2.79 # Backward-rewritten : 99
% 18.37/2.79 # Generated clauses : 149724
% 18.37/2.79 # ...of the previous two non-redundant : 125691
% 18.37/2.79 # ...aggressively subsumed : 0
% 18.37/2.79 # Contextual simplify-reflections : 11
% 18.37/2.79 # Paramodulations : 149716
% 18.37/2.79 # Factorizations : 8
% 18.37/2.79 # NegExts : 0
% 18.37/2.79 # Equation resolutions : 0
% 18.94/2.79 # Total rewrite steps : 55508
% 18.94/2.79 # Propositional unsat checks : 0
% 18.94/2.79 # Propositional check models : 0
% 18.94/2.79 # Propositional check unsatisfiable : 0
% 18.94/2.79 # Propositional clauses : 0
% 18.94/2.79 # Propositional clauses after purity: 0
% 18.94/2.79 # Propositional unsat core size : 0
% 18.94/2.79 # Propositional preprocessing time : 0.000
% 18.94/2.79 # Propositional encoding time : 0.000
% 18.94/2.79 # Propositional solver time : 0.000
% 18.94/2.79 # Success case prop preproc time : 0.000
% 18.94/2.79 # Success case prop encoding time : 0.000
% 18.94/2.79 # Success case prop solver time : 0.000
% 18.94/2.79 # Current number of processed clauses : 8546
% 18.94/2.79 # Positive orientable unit clauses : 4513
% 18.94/2.79 # Positive unorientable unit clauses: 0
% 18.94/2.79 # Negative unit clauses : 3
% 18.94/2.79 # Non-unit-clauses : 4030
% 18.94/2.79 # Current number of unprocessed clauses: 110999
% 18.94/2.79 # ...number of literals in the above : 246788
% 18.94/2.79 # Current number of archived formulas : 0
% 18.94/2.79 # Current number of archived clauses : 139
% 18.94/2.79 # Clause-clause subsumption calls (NU) : 921642
% 18.94/2.79 # Rec. Clause-clause subsumption calls : 689687
% 18.94/2.79 # Non-unit clause-clause subsumptions : 1013
% 18.94/2.79 # Unit Clause-clause subsumption calls : 83750
% 18.94/2.79 # Rewrite failures with RHS unbound : 0
% 18.94/2.79 # BW rewrite match attempts : 20074
% 18.94/2.79 # BW rewrite match successes : 94
% 18.94/2.79 # Condensation attempts : 0
% 18.94/2.79 # Condensation successes : 0
% 18.94/2.79 # Termbank termtop insertions : 2365974
% 18.94/2.79
% 18.94/2.79 # -------------------------------------------------
% 18.94/2.79 # User time : 2.260 s
% 18.94/2.79 # System time : 0.065 s
% 18.94/2.79 # Total time : 2.325 s
% 18.94/2.79 # Maximum resident set size: 1656 pages
% 18.94/2.79
% 18.94/2.79 # -------------------------------------------------
% 18.94/2.79 # User time : 11.378 s
% 18.94/2.79 # System time : 0.297 s
% 18.94/2.79 # Total time : 11.676 s
% 18.94/2.79 # Maximum resident set size: 1700 pages
% 18.94/2.79 % E---3.1 exiting
% 18.95/2.80 % E---3.1 exiting
%------------------------------------------------------------------------------