TSTP Solution File: HEN003-2 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : HEN003-2 : 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:59 EDT 2022
% Result : Unsatisfiable 2.32s 0.68s
% Output : Proof 2.32s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ quotient(x,x,zero),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_x_divide_x_is_zero)]) ).
cnf(g1,plain,
sPE(x,x),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g2,plain,
sPE(zero,zero),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g3,plain,
quotient(zero,x,zero),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zero_divide_anything_is_zero)]) ).
cnf(g4,plain,
quotient(x,x,divide(x,x)),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',closure)]) ).
cnf(g5,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(g6,plain,
quotient(x,zero,divide(x,zero)),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',closure)]) ).
cnf(g7,plain,
( ~ sPE(x,x)
| ~ sPE(x,x)
| sPE(divide(x,x),divide(x,x)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g8,plain,
less_equal(zero,divide(x,x)),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',zero_is_smallest)]) ).
cnf(g9,plain,
( ~ less_equal(divide(x,x),zero)
| ~ less_equal(zero,divide(x,x))
| sPE(divide(x,x),zero) ),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',less_equal_and_equal)]) ).
cnf(g10,plain,
( ~ quotient(divide(x,x),zero,zero)
| less_equal(divide(x,x),zero) ),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',less_equal_quotient)]) ).
cnf(g11,plain,
( ~ less_equal(zero,divide(divide(x,x),zero))
| ~ less_equal(divide(divide(x,x),zero),zero)
| sPE(zero,divide(divide(x,x),zero)) ),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',less_equal_and_equal)]) ).
cnf(g12,plain,
quotient(divide(x,x),zero,divide(divide(x,x),zero)),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',closure)]) ).
cnf(g13,plain,
( ~ sPE(zero,divide(divide(x,x),zero))
| sPE(divide(divide(x,x),zero),zero) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g14,plain,
( ~ quotient(zero,divide(divide(x,x),zero),zero)
| less_equal(zero,divide(divide(x,x),zero)) ),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',less_equal_quotient)]) ).
cnf(g15,plain,
quotient(zero,divide(divide(x,x),zero),zero),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zero_divide_anything_is_zero)]) ).
cnf(g16,plain,
( ~ quotient(x,zero,divide(x,zero))
| ~ quotient(x,x,divide(x,x))
| ~ quotient(zero,x,zero)
| ~ quotient(divide(x,zero),x,zero)
| ~ quotient(divide(x,x),zero,divide(divide(x,x),zero))
| less_equal(divide(divide(x,x),zero),zero) ),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',quotient_property)]) ).
cnf(g17,plain,
( ~ less_equal(divide(x,zero),x)
| quotient(divide(x,zero),x,zero) ),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',quotient_less_equal)]) ).
cnf(g18,plain,
( ~ quotient(x,zero,divide(x,zero))
| less_equal(divide(x,zero),x) ),
inference(ground_cnf,[],[file('Axioms/HEN001-0.ax',divisor_existence)]) ).
cnf(g19,plain,
( ~ sPE(divide(x,x),divide(x,x))
| ~ sPE(zero,zero)
| ~ sPE(divide(divide(x,x),zero),zero)
| ~ quotient(divide(x,x),zero,divide(divide(x,x),zero))
| quotient(divide(x,x),zero,zero) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : HEN003-2 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.14 % Command : satcop --statistics %s
% 0.13/0.35 % Computer : n004.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Fri Jul 1 13:20:53 EDT 2022
% 0.13/0.35 % CPUTime :
% 2.32/0.68 % symbols: 8
% 2.32/0.68 % clauses: 18
% 2.32/0.68 % start clauses: 1
% 2.32/0.68 % iterative deepening steps: 1073
% 2.32/0.68 % maximum path limit: 7
% 2.32/0.68 % literal attempts: 559073
% 2.32/0.68 % depth failures: 295403
% 2.32/0.68 % regularity failures: 36451
% 2.32/0.68 % tautology failures: 44281
% 2.32/0.68 % reductions: 0
% 2.32/0.68 % extensions: 558146
% 2.32/0.68 % SAT variables: 10408
% 2.32/0.68 % SAT clauses: 38672
% 2.32/0.68 % WalkSAT solutions: 38673
% 2.32/0.68 % CDCL solutions: 0
% 2.32/0.68 % SZS status Unsatisfiable for theBenchmark
% 2.32/0.68 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------