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

View Problem - Process Solution

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

% Computer : n017.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:28 EDT 2022

% Result   : Unsatisfiable 0.14s 0.36s
% Output   : Proof 0.14s
% 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(a,b),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_equals_b_4)]) ).

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

cnf(g3,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(g4,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(g5,plain,
    defined(a),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined)]) ).

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : FLD037-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.07/0.13  % Command  : satcop --statistics %s
% 0.14/0.35  % Computer : n017.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Mon Jun  6 13:14:46 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.14/0.36  % symbols: 13
% 0.14/0.36  % clauses: 32
% 0.14/0.36  % start clauses: 3
% 0.14/0.36  % iterative deepening steps: 31
% 0.14/0.36  % maximum path limit: 2
% 0.14/0.36  % literal attempts: 2029
% 0.14/0.36  % depth failures: 1627
% 0.14/0.36  % regularity failures: 47
% 0.14/0.36  % tautology failures: 24
% 0.14/0.36  % reductions: 13
% 0.14/0.36  % extensions: 1927
% 0.14/0.36  % SAT variables: 851
% 0.14/0.36  % SAT clauses: 946
% 0.14/0.36  % WalkSAT solutions: 938
% 0.14/0.36  % CDCL solutions: 0
% 0.14/0.36  % SZS status Unsatisfiable for theBenchmark
% 0.14/0.36  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------