TSTP Solution File: FLD074-3 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : FLD074-3 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n022.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:45 EDT 2022
% Result : Unsatisfiable 89.29s 11.56s
% Output : Proof 89.29s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
less_or_equal(a,b),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_4)]) ).
cnf(g1,plain,
less_or_equal(additive_identity,c),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_5)]) ).
cnf(g2,plain,
~ less_or_equal(multiply(a,c),multiply(b,c)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_6)]) ).
cnf(g3,plain,
( ~ defined(a)
| ~ defined(c)
| defined(multiply(a,c)) ),
inference(ground_cnf,[],[file('Axioms/FLD002-0.ax',well_definedness_of_multiplication)]) ).
cnf(g4,plain,
( ~ defined(multiply(a,c))
| sum(additive_identity,multiply(a,c),multiply(a,c)) ),
inference(ground_cnf,[],[file('Axioms/FLD002-0.ax',existence_of_identity_addition)]) ).
cnf(g5,plain,
defined(a),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined)]) ).
cnf(g6,plain,
defined(b),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined)]) ).
cnf(g7,plain,
defined(c),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_is_defined)]) ).
cnf(g8,plain,
( ~ defined(b)
| ~ defined(c)
| product(b,c,multiply(b,c)) ),
inference(ground_cnf,[],[file('Axioms/FLD002-0.ax',totality_of_multiplication)]) ).
cnf(g9,plain,
( ~ defined(a)
| ~ defined(c)
| product(a,c,multiply(a,c)) ),
inference(ground_cnf,[],[file('Axioms/FLD002-0.ax',totality_of_multiplication)]) ).
cnf(g10,plain,
( ~ defined(b)
| sum(additive_identity,b,b) ),
inference(ground_cnf,[],[file('Axioms/FLD002-0.ax',existence_of_identity_addition)]) ).
cnf(g11,plain,
( ~ sum(additive_identity,b,b)
| sum(b,additive_identity,b) ),
inference(ground_cnf,[],[file('Axioms/FLD002-0.ax',commutativity_addition)]) ).
cnf(g12,plain,
( ~ defined(a)
| sum(additive_inverse(a),a,additive_identity) ),
inference(ground_cnf,[],[file('Axioms/FLD002-0.ax',existence_of_inverse_addition)]) ).
cnf(g13,plain,
( ~ sum(additive_inverse(a),a,additive_identity)
| sum(a,additive_inverse(a),additive_identity) ),
inference(ground_cnf,[],[file('Axioms/FLD002-0.ax',commutativity_addition)]) ).
cnf(g14,plain,
( ~ sum(a,additive_inverse(a),additive_identity)
| ~ sum(b,additive_inverse(a),add(b,additive_inverse(a)))
| ~ less_or_equal(a,b)
| less_or_equal(additive_identity,add(b,additive_inverse(a))) ),
inference(ground_cnf,[],[file('Axioms/FLD002-0.ax',compatibility_of_order_relation_and_addition)]) ).
cnf(g15,plain,
( ~ defined(b)
| ~ defined(additive_inverse(a))
| sum(b,additive_inverse(a),add(b,additive_inverse(a))) ),
inference(ground_cnf,[],[file('Axioms/FLD002-0.ax',totality_of_addition)]) ).
cnf(g16,plain,
( ~ defined(a)
| defined(additive_inverse(a)) ),
inference(ground_cnf,[],[file('Axioms/FLD002-0.ax',well_definedness_of_additive_inverse)]) ).
cnf(g17,plain,
( ~ defined(b)
| ~ defined(additive_inverse(a))
| defined(add(b,additive_inverse(a))) ),
inference(ground_cnf,[],[file('Axioms/FLD002-0.ax',well_definedness_of_addition)]) ).
cnf(g18,plain,
( ~ sum(b,additive_inverse(a),add(b,additive_inverse(a)))
| ~ sum(b,additive_identity,b)
| ~ sum(additive_inverse(a),a,additive_identity)
| sum(add(b,additive_inverse(a)),a,b) ),
inference(ground_cnf,[],[file('Axioms/FLD002-0.ax',associativity_addition_2)]) ).
cnf(g19,plain,
( ~ sum(additive_identity,multiply(a,c),multiply(a,c))
| ~ sum(multiply(c,add(b,additive_inverse(a))),multiply(a,c),multiply(b,c))
| ~ less_or_equal(additive_identity,multiply(c,add(b,additive_inverse(a))))
| less_or_equal(multiply(a,c),multiply(b,c)) ),
inference(ground_cnf,[],[file('Axioms/FLD002-0.ax',compatibility_of_order_relation_and_addition)]) ).
cnf(g20,plain,
( ~ sum(add(b,additive_inverse(a)),a,b)
| ~ product(add(b,additive_inverse(a)),c,multiply(c,add(b,additive_inverse(a))))
| ~ product(a,c,multiply(a,c))
| ~ product(b,c,multiply(b,c))
| sum(multiply(c,add(b,additive_inverse(a))),multiply(a,c),multiply(b,c)) ),
inference(ground_cnf,[],[file('Axioms/FLD002-0.ax',distributivity_1)]) ).
cnf(g21,plain,
( ~ product(c,add(b,additive_inverse(a)),multiply(c,add(b,additive_inverse(a))))
| product(add(b,additive_inverse(a)),c,multiply(c,add(b,additive_inverse(a)))) ),
inference(ground_cnf,[],[file('Axioms/FLD002-0.ax',commutativity_multiplication)]) ).
cnf(g22,plain,
( ~ defined(c)
| ~ defined(add(b,additive_inverse(a)))
| product(c,add(b,additive_inverse(a)),multiply(c,add(b,additive_inverse(a)))) ),
inference(ground_cnf,[],[file('Axioms/FLD002-0.ax',totality_of_multiplication)]) ).
cnf(g23,plain,
( ~ product(c,add(b,additive_inverse(a)),multiply(c,add(b,additive_inverse(a))))
| ~ less_or_equal(additive_identity,c)
| ~ less_or_equal(additive_identity,add(b,additive_inverse(a)))
| less_or_equal(additive_identity,multiply(c,add(b,additive_inverse(a)))) ),
inference(ground_cnf,[],[file('Axioms/FLD002-0.ax',compatibility_of_order_relation_and_multiplication)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : FLD074-3 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/0.13 % Command : satcop --statistics %s
% 0.13/0.32 % Computer : n022.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 600
% 0.13/0.32 % DateTime : Mon Jun 6 21:54:50 EDT 2022
% 0.13/0.33 % CPUTime :
% 89.29/11.56 % symbols: 15
% 89.29/11.56 % clauses: 32
% 89.29/11.56 % start clauses: 3
% 89.29/11.56 % iterative deepening steps: 8037
% 89.29/11.56 % maximum path limit: 5
% 89.29/11.56 % literal attempts: 12292956
% 89.29/11.56 % depth failures: 7618059
% 89.29/11.56 % regularity failures: 620493
% 89.29/11.56 % tautology failures: 1457354
% 89.29/11.56 % reductions: 1300479
% 89.29/11.56 % extensions: 10987682
% 89.29/11.56 % SAT variables: 976272
% 89.29/11.56 % SAT clauses: 2279816
% 89.29/11.56 % WalkSAT solutions: 2279609
% 89.29/11.56 % CDCL solutions: 203
% 89.29/11.56 % SZS status Unsatisfiable for theBenchmark
% 89.29/11.56 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------