TSTP Solution File: HEN003-1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : HEN003-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n004.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:01:58 EDT 2022
% Result : Unsatisfiable 1.67s 0.61s
% Output : Proof 1.67s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ quotient(x,x,zero),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_x_divide_x_is_zero)]) ).
cnf(g1,plain,
sPE(x,x),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g2,plain,
( ~ sPE(x,x)
| ~ sPE(x,x)
| ~ sPE(divide(x,x),zero)
| ~ quotient(x,x,divide(x,x))
| quotient(x,x,zero) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g3,plain,
quotient(x,x,divide(x,x)),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',closure)]) ).
cnf(g4,plain,
( ~ sPE(x,x)
| ~ sPE(x,x)
| sPE(divide(x,x),divide(x,x)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g5,plain,
( ~ less_equal(divide(x,x),x)
| quotient(divide(x,x),x,zero) ),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',quotient_less_equal)]) ).
cnf(g6,plain,
( ~ quotient(x,x,divide(x,x))
| less_equal(divide(x,x),x) ),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',divisor_existence)]) ).
cnf(g7,plain,
( ~ less_equal(divide(divide(x,x),divide(x,x)),zero)
| ~ less_equal(zero,divide(divide(x,x),divide(x,x)))
| sPE(divide(divide(x,x),divide(x,x)),zero) ),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',less_equal_and_equal)]) ).
cnf(g8,plain,
( ~ quotient(x,x,divide(x,x))
| ~ quotient(x,x,divide(x,x))
| ~ quotient(x,x,divide(x,x))
| ~ quotient(divide(x,x),x,zero)
| ~ quotient(divide(x,x),divide(x,x),divide(divide(x,x),divide(x,x)))
| less_equal(divide(divide(x,x),divide(x,x)),zero) ),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',quotient_property)]) ).
cnf(g9,plain,
quotient(divide(x,x),divide(x,x),divide(divide(x,x),divide(x,x))),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',closure)]) ).
cnf(g10,plain,
quotient(x,divide(x,x),divide(x,divide(x,x))),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',closure)]) ).
cnf(g11,plain,
less_equal(zero,divide(divide(x,x),divide(x,x))),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',zero_is_smallest)]) ).
cnf(g12,plain,
quotient(divide(x,x),x,divide(divide(x,x),x)),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',closure)]) ).
cnf(g13,plain,
sPE(divide(divide(x,x),divide(x,x)),divide(divide(x,x),divide(x,x))),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g14,plain,
( ~ quotient(x,x,divide(x,x))
| ~ quotient(x,x,divide(x,x))
| ~ quotient(x,x,divide(x,x))
| ~ quotient(divide(x,x),x,divide(divide(x,x),x))
| ~ quotient(divide(x,x),divide(x,x),divide(divide(x,x),divide(x,x)))
| less_equal(divide(divide(x,x),divide(x,x)),divide(divide(x,x),x)) ),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',quotient_property)]) ).
cnf(g15,plain,
( ~ less_equal(divide(x,x),divide(divide(x,x),divide(x,x)))
| ~ less_equal(divide(divide(x,x),divide(x,x)),divide(x,x))
| sPE(divide(x,x),divide(divide(x,x),divide(x,x))) ),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',less_equal_and_equal)]) ).
cnf(g16,plain,
( ~ less_equal(divide(divide(x,x),x),divide(divide(x,x),divide(x,x)))
| ~ less_equal(divide(divide(x,x),divide(x,x)),divide(divide(x,x),x))
| sPE(divide(divide(x,x),x),divide(divide(x,x),divide(x,x))) ),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',less_equal_and_equal)]) ).
cnf(g17,plain,
( ~ sPE(zero,divide(divide(x,x),x))
| ~ sPE(divide(divide(x,x),divide(x,x)),divide(divide(x,x),divide(x,x)))
| ~ less_equal(zero,divide(divide(x,x),divide(x,x)))
| less_equal(divide(divide(x,x),x),divide(divide(x,x),divide(x,x))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g18,plain,
( ~ sPE(divide(x,x),divide(divide(x,x),divide(x,x)))
| ~ sPE(divide(divide(x,x),divide(x,x)),zero)
| sPE(divide(x,x),zero) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g19,plain,
( ~ quotient(divide(x,x),x,zero)
| ~ quotient(divide(x,x),x,divide(divide(x,x),x))
| sPE(zero,divide(divide(x,x),x)) ),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',well_defined)]) ).
cnf(g20,plain,
( ~ less_equal(divide(x,divide(x,x)),x)
| quotient(divide(x,divide(x,x)),x,zero) ),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',quotient_less_equal)]) ).
cnf(g21,plain,
( ~ quotient(x,divide(x,x),divide(x,divide(x,x)))
| less_equal(divide(x,divide(x,x)),x) ),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',divisor_existence)]) ).
cnf(g22,plain,
( ~ quotient(divide(x,x),divide(divide(x,x),divide(x,x)),zero)
| less_equal(divide(x,x),divide(divide(x,x),divide(x,x))) ),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',less_equal_quotient)]) ).
cnf(g23,plain,
( ~ quotient(divide(x,x),divide(x,x),divide(divide(x,x),divide(x,x)))
| less_equal(divide(divide(x,x),divide(x,x)),divide(x,x)) ),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',divisor_existence)]) ).
cnf(g24,plain,
quotient(divide(x,x),divide(divide(x,x),x),divide(divide(x,x),divide(divide(x,x),x))),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',closure)]) ).
cnf(g25,plain,
( ~ less_equal(divide(divide(x,x),divide(divide(x,x),x)),zero)
| ~ less_equal(zero,divide(divide(x,x),divide(divide(x,x),x)))
| sPE(divide(divide(x,x),divide(divide(x,x),x)),zero) ),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',less_equal_and_equal)]) ).
cnf(g26,plain,
less_equal(zero,divide(divide(x,x),divide(divide(x,x),x))),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',zero_is_smallest)]) ).
cnf(g27,plain,
( ~ quotient(x,divide(x,x),divide(x,divide(x,x)))
| ~ quotient(x,x,divide(x,x))
| ~ quotient(divide(x,x),x,divide(divide(x,x),x))
| ~ quotient(divide(x,divide(x,x)),x,zero)
| ~ quotient(divide(x,x),divide(divide(x,x),x),divide(divide(x,x),divide(divide(x,x),x)))
| less_equal(divide(divide(x,x),divide(divide(x,x),x)),zero) ),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',quotient_property)]) ).
cnf(g28,plain,
( ~ sPE(divide(x,x),divide(x,x))
| ~ sPE(divide(divide(x,x),x),divide(divide(x,x),divide(x,x)))
| ~ sPE(divide(divide(x,x),divide(divide(x,x),x)),zero)
| ~ quotient(divide(x,x),divide(divide(x,x),x),divide(divide(x,x),divide(divide(x,x),x)))
| quotient(divide(x,x),divide(divide(x,x),divide(x,x)),zero) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : HEN003-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : satcop --statistics %s
% 0.12/0.33 % Computer : n004.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 13:46:38 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.67/0.61 % symbols: 8
% 1.67/0.61 % clauses: 16
% 1.67/0.61 % start clauses: 1
% 1.67/0.61 % iterative deepening steps: 613
% 1.67/0.61 % maximum path limit: 7
% 1.67/0.61 % literal attempts: 296568
% 1.67/0.61 % depth failures: 164759
% 1.67/0.61 % regularity failures: 15954
% 1.67/0.61 % tautology failures: 17767
% 1.67/0.61 % reductions: 0
% 1.67/0.61 % extensions: 296113
% 1.67/0.61 % SAT variables: 9015
% 1.67/0.61 % SAT clauses: 28576
% 1.67/0.61 % WalkSAT solutions: 28575
% 1.67/0.61 % CDCL solutions: 0
% 1.67/0.61 % SZS status Unsatisfiable for theBenchmark
% 1.67/0.61 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------