TSTP Solution File: SWV373+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : SWV373+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n019.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:48 EDT 2022
% Result : Theorem 0.12s 0.34s
% Output : Proof 0.12s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ contains_cpq(triple(sK0,sK1,sK2),findmin_cpq_res(triple(sK0,sK1,sK2))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',l9_co)]) ).
cnf(g1,plain,
ok(findmin_cpq_eff(triple(sK0,sK1,sK2))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',l9_co)]) ).
cnf(g2,plain,
( ~ ok(findmin_cpq_eff(triple(sK0,sK1,sK2)))
| contains_slb(sK1,findmin_pqp_res(sK0)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',l9_l10)]) ).
cnf(g3,plain,
( ~ sPE(sK1,create_slb)
| ~ ok(findmin_cpq_eff(triple(sK0,sK1,sK2))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',l9_l10)]) ).
cnf(g4,plain,
( ~ sPE(findmin_cpq_res(triple(sK0,sK1,sK2)),findmin_pqp_res(sK0))
| sPE(findmin_pqp_res(sK0),findmin_cpq_res(triple(sK0,sK1,sK2))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g5,plain,
( sPE(sK1,create_slb)
| sPE(findmin_cpq_res(triple(sK0,sK1,sK2)),findmin_pqp_res(sK0)) ),
inference(ground_cnf,[],[file('Axioms/SWV007+3.ax',ax51)]) ).
cnf(g6,plain,
( ~ sPE(triple(sK0,sK1,sK2),triple(sK0,sK1,sK2))
| ~ sPE(findmin_pqp_res(sK0),findmin_cpq_res(triple(sK0,sK1,sK2)))
| ~ contains_cpq(triple(sK0,sK1,sK2),findmin_pqp_res(sK0))
| contains_cpq(triple(sK0,sK1,sK2),findmin_cpq_res(triple(sK0,sK1,sK2))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g7,plain,
( ~ contains_slb(sK1,findmin_pqp_res(sK0))
| contains_cpq(triple(sK0,sK1,sK2),findmin_pqp_res(sK0)) ),
inference(ground_cnf,[],[file('Axioms/SWV007+3.ax',ax39)]) ).
cnf(g8,plain,
sPE(triple(sK0,sK1,sK2),triple(sK0,sK1,sK2)),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SWV373+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : satcop --statistics %s
% 0.12/0.33 % Computer : n019.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 : Wed Jun 15 10:48:54 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % symbols: 32
% 0.12/0.34 % clauses: 82
% 0.12/0.34 % start clauses: 2
% 0.12/0.34 % iterative deepening steps: 96
% 0.12/0.34 % maximum path limit: 3
% 0.12/0.34 % literal attempts: 4908
% 0.12/0.34 % depth failures: 3812
% 0.12/0.34 % regularity failures: 21
% 0.12/0.34 % tautology failures: 36
% 0.12/0.34 % reductions: 219
% 0.12/0.34 % extensions: 4555
% 0.12/0.34 % SAT variables: 1876
% 0.12/0.34 % SAT clauses: 1644
% 0.12/0.34 % WalkSAT solutions: 1640
% 0.12/0.34 % CDCL solutions: 0
% 0.12/0.34 % SZS status Theorem for theBenchmark
% 0.12/0.34 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------