TSTP Solution File: HEN004-4 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : HEN004-4 : 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:02:01 EDT 2022
% Result : Unsatisfiable 1.40s 0.59s
% Output : Proof 1.40s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ sPE(divide(a,zero),a),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_x_divide_zero_is_x)]) ).
cnf(g1,plain,
( ~ sPE(a,divide(a,zero))
| sPE(divide(a,zero),a) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g2,plain,
( ~ sPE(divide(a,divide(a,zero)),zero)
| less_equal(a,divide(a,zero)) ),
inference(ground_cnf,[],[file('Axioms/HEN002-0.ax',quotient_less_equal2)]) ).
cnf(g3,plain,
( ~ less_equal(a,divide(a,zero))
| ~ less_equal(divide(a,zero),a)
| sPE(a,divide(a,zero)) ),
inference(ground_cnf,[],[file('Axioms/HEN002-0.ax',less_equal_and_equal)]) ).
cnf(g4,plain,
less_equal(divide(a,zero),a),
inference(ground_cnf,[],[file('Axioms/HEN002-0.ax',quotient_smaller_than_numerator)]) ).
cnf(g5,plain,
sPE(a,a),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g6,plain,
( ~ less_equal(divide(a,divide(a,zero)),zero)
| ~ less_equal(zero,divide(a,divide(a,zero)))
| sPE(divide(a,divide(a,zero)),zero) ),
inference(ground_cnf,[],[file('Axioms/HEN002-0.ax',less_equal_and_equal)]) ).
cnf(g7,plain,
sPE(divide(a,zero),divide(a,zero)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g8,plain,
sPE(zero,zero),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g9,plain,
less_equal(zero,divide(a,divide(a,zero))),
inference(ground_cnf,[],[file('Axioms/HEN002-0.ax',zero_is_smallest)]) ).
cnf(g10,plain,
( ~ sPE(divide(divide(a,divide(a,zero)),zero),zero)
| less_equal(divide(a,divide(a,zero)),zero) ),
inference(ground_cnf,[],[file('Axioms/HEN002-0.ax',quotient_less_equal2)]) ).
cnf(g11,plain,
sPE(divide(divide(a,zero),divide(a,zero)),zero),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',x_divide_x_is_zero)]) ).
cnf(g12,plain,
sPE(divide(zero,divide(a,zero)),zero),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',zero_divide_anything_is_zero)]) ).
cnf(g13,plain,
( ~ sPE(a,a)
| ~ sPE(divide(a,zero),divide(a,zero))
| sPE(divide(a,divide(a,zero)),divide(a,divide(a,zero))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g14,plain,
( ~ less_equal(divide(divide(a,divide(a,zero)),zero),zero)
| ~ less_equal(zero,divide(divide(a,divide(a,zero)),zero))
| sPE(divide(divide(a,divide(a,zero)),zero),zero) ),
inference(ground_cnf,[],[file('Axioms/HEN002-0.ax',less_equal_and_equal)]) ).
cnf(g15,plain,
less_equal(zero,divide(divide(a,divide(a,zero)),zero)),
inference(ground_cnf,[],[file('Axioms/HEN002-0.ax',zero_is_smallest)]) ).
cnf(g16,plain,
( ~ sPE(divide(divide(a,divide(a,zero)),divide(zero,divide(a,zero))),divide(divide(a,divide(a,zero)),zero))
| ~ sPE(zero,zero)
| ~ less_equal(divide(divide(a,divide(a,zero)),divide(zero,divide(a,zero))),zero)
| less_equal(divide(divide(a,divide(a,zero)),zero),zero) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g17,plain,
( ~ sPE(divide(a,divide(a,zero)),divide(a,divide(a,zero)))
| ~ sPE(divide(zero,divide(a,zero)),zero)
| sPE(divide(divide(a,divide(a,zero)),divide(zero,divide(a,zero))),divide(divide(a,divide(a,zero)),zero)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g18,plain,
( ~ sPE(divide(divide(a,divide(a,zero)),divide(zero,divide(a,zero))),divide(divide(a,divide(a,zero)),divide(zero,divide(a,zero))))
| ~ sPE(divide(divide(a,zero),divide(a,zero)),zero)
| ~ less_equal(divide(divide(a,divide(a,zero)),divide(zero,divide(a,zero))),divide(divide(a,zero),divide(a,zero)))
| less_equal(divide(divide(a,divide(a,zero)),divide(zero,divide(a,zero))),zero) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g19,plain,
less_equal(divide(divide(a,divide(a,zero)),divide(zero,divide(a,zero))),divide(divide(a,zero),divide(a,zero))),
inference(ground_cnf,[],[file('Axioms/HEN002-0.ax',quotient_property)]) ).
cnf(g20,plain,
sPE(divide(divide(a,divide(a,zero)),divide(zero,divide(a,zero))),divide(divide(a,divide(a,zero)),divide(zero,divide(a,zero)))),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : HEN004-4 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13 % 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 14:50:53 EDT 2022
% 0.13/0.35 % CPUTime :
% 1.40/0.59 % symbols: 7
% 1.40/0.59 % clauses: 16
% 1.40/0.59 % start clauses: 1
% 1.40/0.59 % iterative deepening steps: 821
% 1.40/0.59 % maximum path limit: 10
% 1.40/0.59 % literal attempts: 156963
% 1.40/0.59 % depth failures: 77223
% 1.40/0.59 % regularity failures: 14714
% 1.40/0.59 % tautology failures: 11454
% 1.40/0.59 % reductions: 0
% 1.40/0.59 % extensions: 156679
% 1.40/0.59 % SAT variables: 18401
% 1.40/0.59 % SAT clauses: 34632
% 1.40/0.59 % WalkSAT solutions: 34630
% 1.40/0.59 % CDCL solutions: 0
% 1.40/0.59 % SZS status Unsatisfiable for theBenchmark
% 1.40/0.59 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------