TSTP Solution File: FLD027-1 by SATCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : FLD027-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n027.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  : 600s
% DateTime : Sat Jul 16 02:26:25 EDT 2022

% Result   : Unsatisfiable 80.76s 10.54s
% Output   : Proof 80.76s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ~ equalish(a,additive_identity),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_not_equal_to_additive_identity_3)]) ).

cnf(g1,plain,
    ~ equalish(b,additive_identity),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_not_equal_to_additive_identity_4)]) ).

cnf(g2,plain,
    equalish(multiplicative_inverse(a),multiplicative_inverse(b)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_inverses_equal)]) ).

cnf(g3,plain,
    ~ equalish(a,b),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_not_equal_to_b_6)]) ).

cnf(g4,plain,
    ( ~ defined(a)
    | equalish(a,additive_identity)
    | equalish(multiply(a,multiplicative_inverse(a)),multiplicative_identity) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',existence_of_inverse_multiplication)]) ).

cnf(g5,plain,
    ( ~ defined(a)
    | equalish(a,additive_identity)
    | defined(multiplicative_inverse(a)) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',well_definedness_of_multiplicative_inverse)]) ).

cnf(g6,plain,
    ( ~ defined(b)
    | equalish(b,additive_identity)
    | defined(multiplicative_inverse(b)) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',well_definedness_of_multiplicative_inverse)]) ).

cnf(g7,plain,
    ( ~ defined(b)
    | equalish(b,additive_identity)
    | equalish(multiply(b,multiplicative_inverse(b)),multiplicative_identity) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',existence_of_inverse_multiplication)]) ).

cnf(g8,plain,
    ( ~ equalish(b,a)
    | equalish(a,b) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',symmetry_of_equality)]) ).

cnf(g9,plain,
    defined(a),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined)]) ).

cnf(g10,plain,
    ( ~ equalish(multiply(a,multiplicative_inverse(a)),multiplicative_identity)
    | ~ defined(a)
    | equalish(multiply(multiply(a,multiplicative_inverse(a)),a),multiply(multiplicative_identity,a)) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_equality_and_multiplication)]) ).

cnf(g11,plain,
    defined(b),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined)]) ).

cnf(g12,plain,
    ( ~ defined(b)
    | equalish(multiply(multiplicative_identity,b),b) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',existence_of_identity_multiplication)]) ).

cnf(g13,plain,
    ( ~ equalish(a,multiply(multiply(a,multiplicative_inverse(a)),a))
    | ~ equalish(multiply(multiply(a,multiplicative_inverse(a)),a),multiply(multiplicative_identity,a))
    | equalish(a,multiply(multiplicative_identity,a)) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).

cnf(g14,plain,
    ( ~ equalish(multiply(multiply(a,multiplicative_inverse(a)),a),multiply(multiplicative_identity,a))
    | ~ equalish(multiply(multiplicative_identity,a),a)
    | equalish(multiply(multiply(a,multiplicative_inverse(a)),a),a) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).

cnf(g15,plain,
    ( ~ defined(multiplicative_inverse(b))
    | ~ defined(b)
    | equalish(multiply(multiplicative_inverse(b),b),multiply(b,multiplicative_inverse(b))) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',commutativity_multiplication)]) ).

cnf(g16,plain,
    ( ~ equalish(a,multiply(multiplicative_identity,b))
    | equalish(multiply(multiplicative_identity,b),a) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',symmetry_of_equality)]) ).

cnf(g17,plain,
    ( ~ equalish(multiply(multiplicative_identity,b),b)
    | equalish(b,multiply(multiplicative_identity,b)) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',symmetry_of_equality)]) ).

cnf(g18,plain,
    ( ~ equalish(a,multiply(multiply(a,multiplicative_inverse(a)),b))
    | ~ equalish(multiply(multiply(a,multiplicative_inverse(a)),b),multiply(multiplicative_identity,b))
    | equalish(a,multiply(multiplicative_identity,b)) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).

cnf(g19,plain,
    ( ~ equalish(multiply(a,multiplicative_inverse(a)),multiplicative_identity)
    | ~ defined(b)
    | equalish(multiply(multiply(a,multiplicative_inverse(a)),b),multiply(multiplicative_identity,b)) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_equality_and_multiplication)]) ).

cnf(g20,plain,
    ( ~ equalish(b,multiply(multiplicative_identity,b))
    | ~ equalish(multiply(multiplicative_identity,b),a)
    | equalish(b,a) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).

cnf(g21,plain,
    ( ~ equalish(multiply(multiply(a,multiplicative_inverse(a)),a),a)
    | equalish(a,multiply(multiply(a,multiplicative_inverse(a)),a)) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',symmetry_of_equality)]) ).

cnf(g22,plain,
    ( ~ defined(a)
    | equalish(multiply(multiplicative_identity,a),a) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',existence_of_identity_multiplication)]) ).

cnf(g23,plain,
    ( ~ equalish(a,multiply(a,multiply(multiplicative_inverse(a),b)))
    | ~ equalish(multiply(a,multiply(multiplicative_inverse(a),b)),multiply(multiply(a,multiplicative_inverse(a)),b))
    | equalish(a,multiply(multiply(a,multiplicative_inverse(a)),b)) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).

cnf(g24,plain,
    ( ~ defined(a)
    | ~ defined(multiplicative_inverse(a))
    | ~ defined(b)
    | equalish(multiply(a,multiply(multiplicative_inverse(a),b)),multiply(multiply(a,multiplicative_inverse(a)),b)) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',associativity_multiplication)]) ).

cnf(g25,plain,
    ( ~ equalish(multiplicative_inverse(a),multiplicative_inverse(b))
    | ~ defined(b)
    | equalish(multiply(multiplicative_inverse(a),b),multiply(multiplicative_inverse(b),b)) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_equality_and_multiplication)]) ).

cnf(g26,plain,
    ( ~ equalish(multiply(multiplicative_inverse(a),b),multiply(multiplicative_inverse(b),b))
    | ~ equalish(multiply(multiplicative_inverse(b),b),multiply(b,multiplicative_inverse(b)))
    | equalish(multiply(multiplicative_inverse(a),b),multiply(b,multiplicative_inverse(b))) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).

cnf(g27,plain,
    ( ~ equalish(multiply(multiplicative_inverse(a),b),multiply(b,multiplicative_inverse(b)))
    | ~ equalish(multiply(b,multiplicative_inverse(b)),multiplicative_identity)
    | equalish(multiply(multiplicative_inverse(a),b),multiplicative_identity) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).

cnf(g28,plain,
    ( ~ equalish(multiply(multiplicative_inverse(a),b),multiplicative_identity)
    | equalish(multiplicative_identity,multiply(multiplicative_inverse(a),b)) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',symmetry_of_equality)]) ).

cnf(g29,plain,
    ( ~ equalish(multiplicative_identity,multiply(multiplicative_inverse(a),b))
    | ~ defined(a)
    | equalish(multiply(multiplicative_identity,a),multiply(multiply(multiplicative_inverse(a),b),a)) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_equality_and_multiplication)]) ).

cnf(g30,plain,
    ( ~ defined(multiplicative_inverse(a))
    | ~ defined(b)
    | defined(multiply(multiplicative_inverse(a),b)) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',well_definedness_of_multiplication)]) ).

cnf(g31,plain,
    ( ~ equalish(a,multiply(multiplicative_identity,a))
    | ~ equalish(multiply(multiplicative_identity,a),multiply(multiply(multiplicative_inverse(a),b),a))
    | equalish(a,multiply(multiply(multiplicative_inverse(a),b),a)) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).

cnf(g32,plain,
    ( ~ equalish(a,multiply(multiply(multiplicative_inverse(a),b),a))
    | ~ equalish(multiply(multiply(multiplicative_inverse(a),b),a),multiply(a,multiply(multiplicative_inverse(a),b)))
    | equalish(a,multiply(a,multiply(multiplicative_inverse(a),b))) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).

cnf(g33,plain,
    ( ~ defined(multiply(multiplicative_inverse(a),b))
    | ~ defined(a)
    | equalish(multiply(multiply(multiplicative_inverse(a),b),a),multiply(a,multiply(multiplicative_inverse(a),b))) ),
    inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',commutativity_multiplication)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14  % Problem  : FLD027-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.13/0.15  % Command  : satcop --statistics %s
% 0.15/0.37  % Computer : n027.cluster.edu
% 0.15/0.37  % Model    : x86_64 x86_64
% 0.15/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37  % Memory   : 8042.1875MB
% 0.15/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit : 300
% 0.15/0.37  % WCLimit  : 600
% 0.15/0.37  % DateTime : Tue Jun  7 01:58:27 EDT 2022
% 0.15/0.37  % CPUTime  : 
% 80.76/10.54  % symbols: 13
% 80.76/10.54  % clauses: 33
% 80.76/10.54  % start clauses: 4
% 80.76/10.54  % iterative deepening steps: 2517
% 80.76/10.54  % maximum path limit: 5
% 80.76/10.54  % literal attempts: 9095664
% 80.76/10.54  % depth failures: 6532069
% 80.76/10.54  % regularity failures: 424716
% 80.76/10.54  % tautology failures: 1296347
% 80.76/10.54  % reductions: 557802
% 80.76/10.54  % extensions: 8534369
% 80.76/10.54  % SAT variables: 402537
% 80.76/10.54  % SAT clauses: 617950
% 80.76/10.54  % WalkSAT solutions: 616420
% 80.76/10.54  % CDCL solutions: 1522
% 80.76/10.54  % SZS status Unsatisfiable for theBenchmark
% 80.76/10.54  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------