TSTP Solution File: SWC239+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : SWC239+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n011.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 : Tue Jul 19 21:55:08 EDT 2022
% Result : Theorem 6.21s 1.13s
% Output : Proof 6.21s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
ssList(sK47),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g1,plain,
ssList(sK49),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g2,plain,
sPE(sK47,sK49),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g3,plain,
~ sPE(nil,sK47),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g4,plain,
( ssItem(sK52)
| sP0 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g5,plain,
( sPE(cons(sK52,nil),sK49)
| sP0 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g6,plain,
( ~ ssList(sK47)
| frontsegP(sK47,sK47) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax43)]) ).
cnf(g7,plain,
( ~ ssList(sK47)
| segmentP(sK47,sK47) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax37)]) ).
cnf(g8,plain,
( ~ ssList(sK47)
| ~ rearsegP(nil,sK47)
| sPE(nil,sK47) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax15)]) ).
cnf(g9,plain,
( ~ ssList(sK47)
| ~ ssList(sK47)
| ~ frontsegP(sK47,sK47)
| ~ frontsegP(sK47,sK47)
| sPE(sK47,sK47) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax13)]) ).
cnf(g10,plain,
( ~ ssList(sK47)
| rearsegP(sK47,sK47) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax9)]) ).
cnf(g11,plain,
( ~ sPE(nil,sK49)
| ~ ssList(sK49)
| rearsegP(nil,sK49) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax18)]) ).
cnf(g12,plain,
( ~ sPE(sK47,sK49)
| ~ sPE(sK47,sK47)
| ~ rearsegP(sK47,sK47)
| rearsegP(sK49,sK47) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g13,plain,
( ~ sPE(sK47,sK47)
| ~ sPE(sK47,sK49)
| ~ segmentP(sK47,sK47)
| segmentP(sK47,sK49) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g14,plain,
( sPE(nil,sK49)
| ~ sP0 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g15,plain,
ssList(nil),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g16,plain,
( ~ ssList(nil)
| ~ ssList(sK49)
| ~ ssList(sK47)
| ~ rearsegP(nil,sK49)
| ~ rearsegP(sK49,sK47)
| rearsegP(nil,sK47) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax50)]) ).
cnf(g17,plain,
( ~ ssList(sK47)
| ~ ssList(cons(sK52,nil))
| ~ segmentP(sK47,cons(sK52,nil))
| sPE(app(app(sK7(sK47,cons(sK52,nil)),cons(sK52,nil)),sK8(sK47,cons(sK52,nil))),sK47) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g18,plain,
( ~ sPE(app(app(sK7(sK47,cons(sK52,nil)),cons(sK52,nil)),sK8(sK47,cons(sK52,nil))),sK47)
| ~ ssItem(sK52)
| ~ ssList(sK7(sK47,cons(sK52,nil)))
| ~ ssList(sK8(sK47,cons(sK52,nil)))
| lt(sK52,sK51(sK52,sK7(sK47,cons(sK52,nil)),sK8(sK47,cons(sK52,nil)))) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax87)]) ).
cnf(g19,plain,
( ~ sPE(app(app(sK7(sK47,cons(sK52,nil)),cons(sK52,nil)),sK8(sK47,cons(sK52,nil))),sK47)
| ~ ssItem(sK52)
| ~ ssList(sK7(sK47,cons(sK52,nil)))
| ~ ssList(sK8(sK47,cons(sK52,nil)))
| ssItem(sK51(sK52,sK7(sK47,cons(sK52,nil)),sK8(sK47,cons(sK52,nil)))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g20,plain,
( ~ ssItem(sK52)
| ~ ssList(nil)
| ssList(cons(sK52,nil)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g21,plain,
( ~ sPE(cons(sK52,nil),sK49)
| sPE(sK49,cons(sK52,nil)) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax8)]) ).
cnf(g22,plain,
( ~ sPE(sK47,sK47)
| ~ sPE(sK49,cons(sK52,nil))
| ~ segmentP(sK47,sK49)
| segmentP(sK47,cons(sK52,nil)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g23,plain,
( ~ sPE(app(app(sK7(sK47,cons(sK52,nil)),cons(sK52,nil)),sK8(sK47,cons(sK52,nil))),sK47)
| ~ ssItem(sK52)
| ~ ssList(sK7(sK47,cons(sK52,nil)))
| ~ ssList(sK8(sK47,cons(sK52,nil)))
| ~ leq(sK52,sK51(sK52,sK7(sK47,cons(sK52,nil)),sK8(sK47,cons(sK52,nil)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g24,plain,
( ~ ssList(sK47)
| ~ ssList(cons(sK52,nil))
| ~ segmentP(sK47,cons(sK52,nil))
| ssList(sK7(sK47,cons(sK52,nil))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g25,plain,
( ~ ssList(sK47)
| ~ ssList(cons(sK52,nil))
| ~ segmentP(sK47,cons(sK52,nil))
| ssList(sK8(sK47,cons(sK52,nil))) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax7)]) ).
cnf(g26,plain,
( ~ ssItem(sK52)
| ~ ssItem(sK51(sK52,sK7(sK47,cons(sK52,nil)),sK8(sK47,cons(sK52,nil))))
| ~ lt(sK52,sK51(sK52,sK7(sK47,cons(sK52,nil)),sK8(sK47,cons(sK52,nil))))
| leq(sK52,sK51(sK52,sK7(sK47,cons(sK52,nil)),sK8(sK47,cons(sK52,nil)))) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax32)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWC239+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.10 % Command : satcop --statistics %s
% 0.10/0.31 % Computer : n011.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 600
% 0.10/0.31 % DateTime : Sun Jun 12 02:54:17 EDT 2022
% 0.10/0.31 % CPUTime :
% 6.21/1.13 % symbols: 80
% 6.21/1.13 % clauses: 278
% 6.21/1.13 % start clauses: 16
% 6.21/1.13 % iterative deepening steps: 866
% 6.21/1.13 % maximum path limit: 2
% 6.21/1.13 % literal attempts: 1573498
% 6.21/1.13 % depth failures: 1531882
% 6.21/1.13 % regularity failures: 840
% 6.21/1.13 % tautology failures: 8623
% 6.21/1.13 % reductions: 6076
% 6.21/1.13 % extensions: 1553768
% 6.21/1.13 % SAT variables: 317604
% 6.21/1.13 % SAT clauses: 303147
% 6.21/1.13 % WalkSAT solutions: 303131
% 6.21/1.13 % CDCL solutions: 8
% 6.21/1.13 % SZS status Theorem for theBenchmark
% 6.21/1.13 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------