TSTP Solution File: HEN005-1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : HEN005-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n007.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 13:02:02 EDT 2022
% Result : Unsatisfiable 8.41s 1.41s
% Output : Proof 8.41s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ less_equal(x,z),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_transitivity_of_less_equal)]) ).
cnf(g1,plain,
( ~ quotient(x,z,zero)
| less_equal(x,z) ),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',less_equal_quotient)]) ).
cnf(g2,plain,
sPE(z,z),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g3,plain,
less_equal(y,z),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',yLEz)]) ).
cnf(g4,plain,
less_equal(zero,z),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',zero_is_smallest)]) ).
cnf(g5,plain,
sPE(x,x),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g6,plain,
less_equal(x,y),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xLEy)]) ).
cnf(g7,plain,
sPE(zero,zero),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g8,plain,
( ~ sPE(x,x)
| ~ sPE(z,z)
| ~ sPE(divide(x,z),zero)
| ~ quotient(x,z,divide(x,z))
| quotient(x,z,zero) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g9,plain,
quotient(x,z,divide(x,z)),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',closure)]) ).
cnf(g10,plain,
( ~ less_equal(divide(x,z),zero)
| ~ less_equal(zero,divide(x,z))
| sPE(divide(x,z),zero) ),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',less_equal_and_equal)]) ).
cnf(g11,plain,
( ~ less_equal(x,y)
| quotient(x,y,zero) ),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',quotient_less_equal)]) ).
cnf(g12,plain,
( ~ less_equal(y,z)
| quotient(y,z,zero) ),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',quotient_less_equal)]) ).
cnf(g13,plain,
( ~ quotient(divide(x,z),zero,zero)
| less_equal(divide(x,z),zero) ),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',less_equal_quotient)]) ).
cnf(g14,plain,
sPE(divide(x,z),divide(x,z)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g15,plain,
less_equal(zero,divide(x,z)),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',zero_is_smallest)]) ).
cnf(g16,plain,
quotient(x,y,divide(x,y)),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',closure)]) ).
cnf(g17,plain,
( ~ quotient(x,y,divide(x,y))
| ~ quotient(x,y,zero)
| sPE(divide(x,y),zero) ),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',well_defined)]) ).
cnf(g18,plain,
quotient(divide(x,z),zero,divide(divide(x,z),zero)),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',closure)]) ).
cnf(g19,plain,
( ~ less_equal(divide(x,y),z)
| quotient(divide(x,y),z,zero) ),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',quotient_less_equal)]) ).
cnf(g20,plain,
( ~ sPE(divide(x,y),zero)
| sPE(zero,divide(x,y)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g21,plain,
less_equal(zero,divide(divide(x,z),zero)),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',zero_is_smallest)]) ).
cnf(g22,plain,
( ~ sPE(divide(x,z),divide(x,z))
| ~ sPE(zero,zero)
| ~ sPE(divide(divide(x,z),zero),zero)
| ~ quotient(divide(x,z),zero,divide(divide(x,z),zero))
| quotient(divide(x,z),zero,zero) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g23,plain,
( ~ less_equal(divide(divide(x,z),zero),zero)
| ~ less_equal(zero,divide(divide(x,z),zero))
| sPE(divide(divide(x,z),zero),zero) ),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',less_equal_and_equal)]) ).
cnf(g24,plain,
( ~ quotient(x,y,divide(x,y))
| ~ quotient(x,z,divide(x,z))
| ~ quotient(y,z,zero)
| ~ quotient(divide(x,y),z,zero)
| ~ quotient(divide(x,z),zero,divide(divide(x,z),zero))
| less_equal(divide(divide(x,z),zero),zero) ),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',quotient_property)]) ).
cnf(g25,plain,
( ~ sPE(zero,divide(x,y))
| ~ sPE(z,z)
| ~ less_equal(zero,z)
| less_equal(divide(x,y),z) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : HEN005-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.06/0.12 % Command : satcop --statistics %s
% 0.12/0.33 % Computer : n007.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jul 1 12:53:54 EDT 2022
% 0.12/0.33 % CPUTime :
% 8.41/1.41 % symbols: 10
% 8.41/1.41 % clauses: 18
% 8.41/1.41 % start clauses: 1
% 8.41/1.41 % iterative deepening steps: 1881
% 8.41/1.41 % maximum path limit: 10
% 8.41/1.41 % literal attempts: 2234355
% 8.41/1.41 % depth failures: 1251067
% 8.41/1.41 % regularity failures: 114504
% 8.41/1.41 % tautology failures: 142453
% 8.41/1.41 % reductions: 0
% 8.41/1.41 % extensions: 2232980
% 8.41/1.41 % SAT variables: 32173
% 8.41/1.41 % SAT clauses: 118693
% 8.41/1.41 % WalkSAT solutions: 118693
% 8.41/1.41 % CDCL solutions: 1
% 8.41/1.41 % SZS status Unsatisfiable for theBenchmark
% 8.41/1.41 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------