TSTP Solution File: SWV407+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : SWV407+1 : TPTP v8.1.0. Released v3.3.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 : Wed Jul 20 21:28:55 EDT 2022
% Result : Theorem 6.64s 1.21s
% Output : Proof 6.64s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
contains_cpq(triple(sK3,sK4,sK5),sK6),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l43_co)]) ).
cnf(g1,plain,
strictly_less_than(sK6,findmin_cpq_res(triple(sK3,sK4,sK5))),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l43_co)]) ).
cnf(g2,plain,
check_cpq(findmin_cpq_eff(triple(sK3,sK4,sK5))),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l43_co)]) ).
cnf(g3,plain,
( ~ contains_cpq(triple(sK3,sK4,sK5),sK6)
| contains_slb(sK4,sK6) ),
inference(ground_cnf,[],[file('Axioms/SWV007+3.ax',ax39)]) ).
cnf(g4,plain,
( ~ strictly_less_than(sK6,findmin_cpq_res(triple(sK3,sK4,sK5)))
| ~ contains_slb(sK4,sK6)
| pair_in_list(update_slb(sK4,findmin_pqp_res(sK3)),sK6,findmin_pqp_res(sK3))
| pair_in_list(update_slb(sK4,findmin_pqp_res(sK3)),sK6,sK2(sK3,sK4,sK5,sK6)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l43_l44)]) ).
cnf(g5,plain,
( ~ strictly_less_than(sK6,findmin_cpq_res(triple(sK3,sK4,sK5)))
| ~ contains_slb(sK4,sK6)
| less_than(findmin_pqp_res(sK3),sK2(sK3,sK4,sK5,sK6))
| pair_in_list(update_slb(sK4,findmin_pqp_res(sK3)),sK6,findmin_pqp_res(sK3)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l43_l44)]) ).
cnf(g6,plain,
sPE(sK6,sK6),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g7,plain,
( ~ sPE(sK6,sK6)
| ~ sPE(findmin_cpq_res(triple(sK3,sK4,sK5)),findmin_pqp_res(sK3))
| ~ strictly_less_than(sK6,findmin_cpq_res(triple(sK3,sK4,sK5)))
| strictly_less_than(sK6,findmin_pqp_res(sK3)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g8,plain,
( sPE(sK4,create_slb)
| sPE(findmin_cpq_res(triple(sK3,sK4,sK5)),findmin_pqp_res(sK3)) ),
inference(ground_cnf,[],[file('Axioms/SWV007+3.ax',ax51)]) ).
cnf(g9,plain,
( ~ pair_in_list(update_slb(sK4,findmin_pqp_res(sK3)),sK6,sK2(sK3,sK4,sK5,sK6))
| ~ check_cpq(triple(sK5,update_slb(sK4,findmin_pqp_res(sK3)),sK5))
| less_than(sK2(sK3,sK4,sK5,sK6),sK6) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l43_li4142)]) ).
cnf(g10,plain,
( ~ sPE(findmin_cpq_eff(triple(sK3,sK4,sK5)),triple(sK3,update_slb(sK4,findmin_pqp_res(sK3)),bad))
| ~ check_cpq(findmin_cpq_eff(triple(sK3,sK4,sK5)))
| check_cpq(triple(sK3,update_slb(sK4,findmin_pqp_res(sK3)),bad)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
( sPE(sK4,create_slb)
| sPE(findmin_cpq_eff(triple(sK3,sK4,sK5)),triple(sK3,update_slb(sK4,findmin_pqp_res(sK3)),bad))
| contains_slb(sK4,findmin_pqp_res(sK3)) ),
inference(ground_cnf,[],[file('Axioms/SWV007+3.ax',ax47)]) ).
cnf(g12,plain,
( ~ sPE(findmin_cpq_eff(triple(sK3,sK4,sK5)),triple(sK3,update_slb(sK4,findmin_pqp_res(sK3)),sK5))
| ~ check_cpq(findmin_cpq_eff(triple(sK3,sK4,sK5)))
| check_cpq(triple(sK3,update_slb(sK4,findmin_pqp_res(sK3)),sK5)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g13,plain,
( ~ less_than(lookup_slb(sK4,findmin_pqp_res(sK3)),findmin_pqp_res(sK3))
| ~ contains_slb(sK4,findmin_pqp_res(sK3))
| sPE(sK4,create_slb)
| sPE(findmin_cpq_eff(triple(sK3,sK4,sK5)),triple(sK3,update_slb(sK4,findmin_pqp_res(sK3)),sK5)) ),
inference(ground_cnf,[],[file('Axioms/SWV007+3.ax',ax49)]) ).
cnf(g14,plain,
( ~ strictly_less_than(findmin_pqp_res(sK3),lookup_slb(sK4,findmin_pqp_res(sK3)))
| ~ contains_slb(sK4,findmin_pqp_res(sK3))
| sPE(sK4,create_slb)
| sPE(findmin_cpq_eff(triple(sK3,sK4,sK5)),triple(sK3,update_slb(sK4,findmin_pqp_res(sK3)),bad)) ),
inference(ground_cnf,[],[file('Axioms/SWV007+3.ax',ax48)]) ).
cnf(g15,plain,
( ~ less_than(findmin_pqp_res(sK3),lookup_slb(sK4,findmin_pqp_res(sK3)))
| less_than(lookup_slb(sK4,findmin_pqp_res(sK3)),findmin_pqp_res(sK3))
| strictly_less_than(findmin_pqp_res(sK3),lookup_slb(sK4,findmin_pqp_res(sK3))) ),
inference(ground_cnf,[],[file('Axioms/SWV007+0.ax',stricly_smaller_definition)]) ).
cnf(g16,plain,
( ~ pair_in_list(update_slb(sK4,findmin_pqp_res(sK3)),sK0(sK5,update_slb(sK4,findmin_pqp_res(sK3)),sK5),sK1(sK5,update_slb(sK4,findmin_pqp_res(sK3)),sK5))
| ~ check_cpq(triple(sK3,update_slb(sK4,findmin_pqp_res(sK3)),bad))
| less_than(sK1(sK5,update_slb(sK4,findmin_pqp_res(sK3)),sK5),sK0(sK5,update_slb(sK4,findmin_pqp_res(sK3)),sK5)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l43_li4142)]) ).
cnf(g17,plain,
( pair_in_list(update_slb(sK4,findmin_pqp_res(sK3)),sK0(sK5,update_slb(sK4,findmin_pqp_res(sK3)),sK5),sK1(sK5,update_slb(sK4,findmin_pqp_res(sK3)),sK5))
| check_cpq(triple(sK5,update_slb(sK4,findmin_pqp_res(sK3)),sK5)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l43_li4142)]) ).
cnf(g18,plain,
( ~ pair_in_list(update_slb(sK4,findmin_pqp_res(sK3)),sK0(sK5,update_slb(sK4,findmin_pqp_res(sK3)),sK5),sK1(sK5,update_slb(sK4,findmin_pqp_res(sK3)),sK5))
| ~ check_cpq(triple(sK3,update_slb(sK4,findmin_pqp_res(sK3)),sK5))
| less_than(sK1(sK5,update_slb(sK4,findmin_pqp_res(sK3)),sK5),sK0(sK5,update_slb(sK4,findmin_pqp_res(sK3)),sK5)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l43_li4142)]) ).
cnf(g19,plain,
( less_than(findmin_pqp_res(sK3),lookup_slb(sK4,findmin_pqp_res(sK3)))
| less_than(lookup_slb(sK4,findmin_pqp_res(sK3)),findmin_pqp_res(sK3)) ),
inference(ground_cnf,[],[file('Axioms/SWV007+0.ax',totality)]) ).
cnf(g20,plain,
( ~ pair_in_list(update_slb(sK4,findmin_pqp_res(sK3)),sK6,findmin_pqp_res(sK3))
| ~ check_cpq(triple(sK5,update_slb(sK4,findmin_pqp_res(sK3)),sK5))
| less_than(findmin_pqp_res(sK3),sK6) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l43_li4142)]) ).
cnf(g21,plain,
( ~ less_than(findmin_pqp_res(sK3),sK6)
| ~ strictly_less_than(sK6,findmin_pqp_res(sK3)) ),
inference(ground_cnf,[],[file('Axioms/SWV007+0.ax',stricly_smaller_definition)]) ).
cnf(g22,plain,
( ~ less_than(sK1(sK5,update_slb(sK4,findmin_pqp_res(sK3)),sK5),sK0(sK5,update_slb(sK4,findmin_pqp_res(sK3)),sK5))
| check_cpq(triple(sK5,update_slb(sK4,findmin_pqp_res(sK3)),sK5)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l43_li4142)]) ).
cnf(g23,plain,
( ~ sPE(sK4,create_slb)
| ~ sPE(sK6,sK6)
| ~ contains_slb(sK4,sK6)
| contains_slb(create_slb,sK6) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g24,plain,
~ contains_slb(create_slb,sK6),
inference(ground_cnf,[],[file('Axioms/SWV007+2.ax',ax20)]) ).
cnf(g25,plain,
( ~ less_than(findmin_pqp_res(sK3),sK2(sK3,sK4,sK5,sK6))
| ~ less_than(sK2(sK3,sK4,sK5,sK6),sK6)
| less_than(findmin_pqp_res(sK3),sK6) ),
inference(ground_cnf,[],[file('Axioms/SWV007+0.ax',transitivity)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWV407+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13 % Command : satcop --statistics %s
% 0.14/0.34 % Computer : n004.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Wed Jun 15 06:22:39 EDT 2022
% 0.14/0.34 % CPUTime :
% 6.64/1.21 % symbols: 36
% 6.64/1.21 % clauses: 88
% 6.64/1.21 % start clauses: 3
% 6.64/1.21 % iterative deepening steps: 1032
% 6.64/1.21 % maximum path limit: 4
% 6.64/1.21 % literal attempts: 2008533
% 6.64/1.21 % depth failures: 1836232
% 6.64/1.21 % regularity failures: 16529
% 6.64/1.21 % tautology failures: 11862
% 6.64/1.21 % reductions: 48183
% 6.64/1.21 % extensions: 1958987
% 6.64/1.21 % SAT variables: 99013
% 6.64/1.21 % SAT clauses: 96847
% 6.64/1.21 % WalkSAT solutions: 96842
% 6.64/1.21 % CDCL solutions: 3
% 6.64/1.21 % SZS status Theorem for theBenchmark
% 6.64/1.21 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------