TSTP Solution File: ANA021-2 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : ANA021-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n015.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 : Thu Jul 14 19:25:43 EDT 2022
% Result : Unsatisfiable 0.19s 0.45s
% Output : Proof 0.19s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ sPE(v_x,c_0),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3)]) ).
cnf(g1,plain,
~ c_lessequals(c_HOL_Oabs(v_f(v_x),t_a),c_times(v_c,c_HOL_Oabs(v_h(v_x),t_a),t_a),t_a),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_4)]) ).
cnf(g2,plain,
( sPE(v_x,c_0)
| c_less(c_0,v_x,tc_nat) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Nat_Onot__gr0_0)]) ).
cnf(g3,plain,
sPE(t_a,t_a),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g4,plain,
( ~ c_less(c_0,v_x,tc_nat)
| sPE(v_x,c_Suc(c_minus(v_x,c_1,tc_nat))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_NatBin_OSuc__pred_H_0)]) ).
cnf(g5,plain,
( ~ sPE(v_x,c_Suc(c_minus(v_x,c_1,tc_nat)))
| sPE(v_h(v_x),v_h(c_Suc(c_minus(v_x,c_1,tc_nat)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g6,plain,
( ~ sPE(v_x,c_Suc(c_minus(v_x,c_1,tc_nat)))
| sPE(v_f(v_x),v_f(c_Suc(c_minus(v_x,c_1,tc_nat)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g7,plain,
sPE(v_c,v_c),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g8,plain,
( ~ sPE(v_h(v_x),v_h(c_Suc(c_minus(v_x,c_1,tc_nat))))
| ~ sPE(t_a,t_a)
| sPE(c_HOL_Oabs(v_h(v_x),t_a),c_HOL_Oabs(v_h(c_Suc(c_minus(v_x,c_1,tc_nat))),t_a)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g9,plain,
( ~ sPE(v_f(v_x),v_f(c_Suc(c_minus(v_x,c_1,tc_nat))))
| sPE(v_f(c_Suc(c_minus(v_x,c_1,tc_nat))),v_f(v_x)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g10,plain,
( ~ sPE(c_HOL_Oabs(v_f(c_Suc(c_minus(v_x,c_1,tc_nat))),t_a),c_HOL_Oabs(v_f(v_x),t_a))
| ~ sPE(c_times(v_c,c_HOL_Oabs(v_h(c_Suc(c_minus(v_x,c_1,tc_nat))),t_a),t_a),c_times(v_c,c_HOL_Oabs(v_h(v_x),t_a),t_a))
| ~ sPE(t_a,t_a)
| ~ c_lessequals(c_HOL_Oabs(v_f(c_Suc(c_minus(v_x,c_1,tc_nat))),t_a),c_times(v_c,c_HOL_Oabs(v_h(c_Suc(c_minus(v_x,c_1,tc_nat))),t_a),t_a),t_a)
| c_lessequals(c_HOL_Oabs(v_f(v_x),t_a),c_times(v_c,c_HOL_Oabs(v_h(v_x),t_a),t_a),t_a) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
c_lessequals(c_HOL_Oabs(v_f(c_Suc(c_minus(v_x,c_1,tc_nat))),t_a),c_times(v_c,c_HOL_Oabs(v_h(c_Suc(c_minus(v_x,c_1,tc_nat))),t_a),t_a),t_a),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2)]) ).
cnf(g12,plain,
( ~ sPE(v_f(c_Suc(c_minus(v_x,c_1,tc_nat))),v_f(v_x))
| ~ sPE(t_a,t_a)
| sPE(c_HOL_Oabs(v_f(c_Suc(c_minus(v_x,c_1,tc_nat))),t_a),c_HOL_Oabs(v_f(v_x),t_a)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g13,plain,
( ~ sPE(c_times(v_c,c_HOL_Oabs(v_h(v_x),t_a),t_a),c_times(v_c,c_HOL_Oabs(v_h(c_Suc(c_minus(v_x,c_1,tc_nat))),t_a),t_a))
| sPE(c_times(v_c,c_HOL_Oabs(v_h(c_Suc(c_minus(v_x,c_1,tc_nat))),t_a),t_a),c_times(v_c,c_HOL_Oabs(v_h(v_x),t_a),t_a)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g14,plain,
( ~ sPE(v_c,v_c)
| ~ sPE(c_HOL_Oabs(v_h(v_x),t_a),c_HOL_Oabs(v_h(c_Suc(c_minus(v_x,c_1,tc_nat))),t_a))
| ~ sPE(t_a,t_a)
| sPE(c_times(v_c,c_HOL_Oabs(v_h(v_x),t_a),t_a),c_times(v_c,c_HOL_Oabs(v_h(c_Suc(c_minus(v_x,c_1,tc_nat))),t_a),t_a)) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ANA021-2 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : satcop --statistics %s
% 0.12/0.34 % Computer : n015.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jul 8 04:55:05 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 % symbols: 16
% 0.19/0.45 % clauses: 16
% 0.19/0.45 % start clauses: 3
% 0.19/0.45 % iterative deepening steps: 571
% 0.19/0.45 % maximum path limit: 5
% 0.19/0.45 % literal attempts: 159478
% 0.19/0.45 % depth failures: 118435
% 0.19/0.45 % regularity failures: 4173
% 0.19/0.45 % tautology failures: 12013
% 0.19/0.45 % reductions: 2302
% 0.19/0.45 % extensions: 155587
% 0.19/0.45 % SAT variables: 12095
% 0.19/0.45 % SAT clauses: 17332
% 0.19/0.45 % WalkSAT solutions: 17330
% 0.19/0.45 % CDCL solutions: 0
% 0.19/0.45 % SZS status Unsatisfiable for theBenchmark
% 0.19/0.45 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------