TSTP Solution File: FLD061-2 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : FLD061-2 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n028.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:39 EDT 2022
% Result : Unsatisfiable 3.76s 0.80s
% Output : Proof 3.76s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
equalish(add(a,c),u),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',add_equals_u_7)]) ).
cnf(g1,plain,
equalish(add(d,b),v),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',add_equals_v_8)]) ).
cnf(g2,plain,
less_or_equal(a,b),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_9)]) ).
cnf(g3,plain,
less_or_equal(c,d),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_10)]) ).
cnf(g4,plain,
~ less_or_equal(u,v),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_11)]) ).
cnf(g5,plain,
( ~ equalish(add(d,b),v)
| equalish(v,add(d,b)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',symmetry_of_equality)]) ).
cnf(g6,plain,
defined(b),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined)]) ).
cnf(g7,plain,
( ~ defined(b)
| ~ less_or_equal(c,d)
| less_or_equal(add(c,b),add(d,b)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_order_relation_and_addition)]) ).
cnf(g8,plain,
defined(v),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',v_is_defined)]) ).
cnf(g9,plain,
defined(c),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_is_defined)]) ).
cnf(g10,plain,
( ~ equalish(v,add(d,b))
| ~ less_or_equal(v,v)
| less_or_equal(add(d,b),v) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_equality_and_order_relation)]) ).
cnf(g11,plain,
( ~ defined(v)
| ~ defined(v)
| less_or_equal(v,v)
| less_or_equal(v,v) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',totality_of_order_relation)]) ).
cnf(g12,plain,
( ~ less_or_equal(u,add(d,b))
| ~ less_or_equal(add(d,b),v)
| less_or_equal(u,v) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_order_relation)]) ).
cnf(g13,plain,
( ~ defined(c)
| ~ less_or_equal(a,b)
| less_or_equal(add(a,c),add(b,c)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_order_relation_and_addition)]) ).
cnf(g14,plain,
( ~ defined(c)
| ~ defined(b)
| defined(add(c,b)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',well_definedness_of_addition)]) ).
cnf(g15,plain,
( ~ defined(c)
| ~ defined(b)
| equalish(add(c,b),add(b,c)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',commutativity_addition)]) ).
cnf(g16,plain,
( ~ less_or_equal(add(a,c),add(b,c))
| ~ less_or_equal(add(b,c),add(c,b))
| less_or_equal(add(a,c),add(c,b)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_order_relation)]) ).
cnf(g17,plain,
( ~ equalish(add(a,c),u)
| ~ less_or_equal(add(a,c),add(c,b))
| less_or_equal(u,add(c,b)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_equality_and_order_relation)]) ).
cnf(g18,plain,
( ~ equalish(add(c,b),add(b,c))
| ~ less_or_equal(add(c,b),add(c,b))
| less_or_equal(add(b,c),add(c,b)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_equality_and_order_relation)]) ).
cnf(g19,plain,
( ~ defined(add(c,b))
| ~ defined(add(c,b))
| less_or_equal(add(c,b),add(c,b))
| less_or_equal(add(c,b),add(c,b)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',totality_of_order_relation)]) ).
cnf(g20,plain,
( ~ less_or_equal(u,add(c,b))
| ~ less_or_equal(add(c,b),add(d,b))
| less_or_equal(u,add(d,b)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_order_relation)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : FLD061-2 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.07/0.14 % Command : satcop --statistics %s
% 0.14/0.35 % Computer : n028.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 20:12:44 EDT 2022
% 0.14/0.35 % CPUTime :
% 3.76/0.80 % symbols: 17
% 3.76/0.80 % clauses: 38
% 3.76/0.80 % start clauses: 5
% 3.76/0.80 % iterative deepening steps: 580
% 3.76/0.80 % maximum path limit: 4
% 3.76/0.80 % literal attempts: 791616
% 3.76/0.80 % depth failures: 511156
% 3.76/0.80 % regularity failures: 49370
% 3.76/0.80 % tautology failures: 128283
% 3.76/0.80 % reductions: 71301
% 3.76/0.80 % extensions: 718923
% 3.76/0.80 % SAT variables: 75728
% 3.76/0.80 % SAT clauses: 121305
% 3.76/0.80 % WalkSAT solutions: 121282
% 3.76/0.80 % CDCL solutions: 20
% 3.76/0.80 % SZS status Unsatisfiable for theBenchmark
% 3.76/0.80 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------