TSTP Solution File: SWC346+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : SWC346+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n006.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:47 EDT 2022
% Result : Theorem 4.02s 0.85s
% Output : Proof 4.21s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
ssList(sK47),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g1,plain,
ssList(sK48),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g2,plain,
ssList(sK49),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g3,plain,
sPE(sK48,sK50),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g4,plain,
sPE(sK47,sK49),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g5,plain,
( ssItem(sK51)
| sP0 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g6,plain,
( ssList(sK52)
| sP0 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g7,plain,
( ssList(sK53)
| sP0 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g8,plain,
( sPE(cons(sK51,nil),sK49)
| sP0 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g9,plain,
( sPE(app(app(sK52,sK49),sK53),sK50)
| sP0 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g10,plain,
( ~ segmentP(sK48,sK47)
| ~ strictorderedP(sK47) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g11,plain,
( ~ ssList(sK47)
| ssItem(sK30(sK47))
| strictorderedP(sK47) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax12)]) ).
cnf(g12,plain,
( ~ ssList(sK47)
| ssItem(sK29(sK47))
| strictorderedP(sK47) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax12)]) ).
cnf(g13,plain,
( ~ ssList(sK47)
| ssList(sK31(sK47))
| strictorderedP(sK47) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax12)]) ).
cnf(g14,plain,
( ~ ssList(sK47)
| ssList(sK32(sK47))
| strictorderedP(sK47) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax12)]) ).
cnf(g15,plain,
( ~ ssList(sK47)
| ssList(sK33(sK47))
| strictorderedP(sK47) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax12)]) ).
cnf(g16,plain,
( ~ ssList(sK47)
| ~ lt(sK29(sK47),sK30(sK47))
| strictorderedP(sK47) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax12)]) ).
cnf(g17,plain,
( ~ ssList(sK47)
| sPE(app(app(sK31(sK47),cons(sK29(sK47),sK32(sK47))),cons(sK30(sK47),sK33(sK47))),sK47)
| strictorderedP(sK47) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax12)]) ).
cnf(g18,plain,
( ~ ssList(sK49)
| segmentP(sK49,sK49) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax55)]) ).
cnf(g19,plain,
( ~ sPE(nil,sK49)
| ~ ssList(sK49)
| segmentP(nil,sK49) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax58)]) ).
cnf(g20,plain,
( ~ ssList(sK49)
| ~ ssList(sK49)
| ~ segmentP(sK49,sK49)
| ~ segmentP(sK49,sK49)
| sPE(sK49,sK49) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax54)]) ).
cnf(g21,plain,
( ~ sPE(sK48,sK50)
| sPE(sK50,sK48) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g22,plain,
( ~ sPE(sK47,sK49)
| sPE(sK49,sK47) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g23,plain,
( sPE(nil,sK50)
| ~ sP0 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g24,plain,
( sPE(nil,sK49)
| ~ sP0 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g25,plain,
( ~ ssList(sK48)
| ~ ssList(sK49)
| ~ ssList(sK47)
| ~ segmentP(sK48,sK49)
| ~ segmentP(sK49,sK47)
| segmentP(sK48,sK47) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax53)]) ).
cnf(g26,plain,
( ~ sPE(sK49,sK47)
| ~ strictorderedP(sK49)
| strictorderedP(sK47) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g27,plain,
( ~ ssItem(sK51)
| duplicatefreeP(cons(sK51,nil)) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax71)]) ).
cnf(g28,plain,
( ~ sPE(cons(sK51,nil),sK49)
| ~ totalorderedP(cons(sK51,nil))
| totalorderedP(sK49) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g29,plain,
( ~ sPE(app(app(sK52,sK49),sK53),sK50)
| ~ sPE(sK49,sK49)
| ~ segmentP(app(app(sK52,sK49),sK53),sK49)
| segmentP(sK50,sK49) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g30,plain,
ssList(nil),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax17)]) ).
cnf(g31,plain,
( ~ sPE(sK50,sK48)
| ~ sPE(sK49,sK49)
| ~ segmentP(sK50,sK49)
| segmentP(sK48,sK49) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g32,plain,
( ~ sPE(sK49,sK49)
| ~ sPE(sK49,sK47)
| ~ segmentP(sK49,sK49)
| segmentP(sK49,sK47) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g33,plain,
( ~ sPE(sK49,sK47)
| ~ duplicatefreeP(sK49)
| duplicatefreeP(sK47) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g34,plain,
( ~ sPE(sK49,sK47)
| ~ totalorderedP(sK49)
| totalorderedP(sK47) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g35,plain,
( ~ sPE(nil,sK49)
| ~ strictorderedP(nil)
| strictorderedP(sK49) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g36,plain,
( ~ sPE(nil,sK50)
| ~ sPE(sK49,sK49)
| ~ segmentP(nil,sK49)
| segmentP(sK50,sK49) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g37,plain,
( ~ sPE(cons(sK51,nil),sK49)
| ~ duplicatefreeP(cons(sK51,nil))
| duplicatefreeP(sK49) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g38,plain,
( ~ ssList(sK49)
| ~ ssList(sK49)
| ~ ssList(sK52)
| ~ ssList(sK53)
| ~ segmentP(sK49,sK49)
| segmentP(app(app(sK52,sK49),sK53),sK49) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax56)]) ).
cnf(g39,plain,
( ~ sPE(app(app(sK31(sK47),cons(sK29(sK47),sK32(sK47))),cons(sK30(sK47),sK33(sK47))),sK47)
| ~ ssItem(sK29(sK47))
| ~ ssItem(sK30(sK47))
| ~ ssList(sK47)
| ~ ssList(sK31(sK47))
| ~ ssList(sK32(sK47))
| ~ ssList(sK33(sK47))
| ~ totalorderedP(sK47)
| leq(sK29(sK47),sK30(sK47)) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax11)]) ).
cnf(g40,plain,
( ~ sPE(sK29(sK47),sK30(sK47))
| ~ sPE(app(app(sK31(sK47),cons(sK29(sK47),sK32(sK47))),cons(sK30(sK47),sK33(sK47))),sK47)
| ~ ssItem(sK29(sK47))
| ~ ssItem(sK30(sK47))
| ~ ssList(sK47)
| ~ ssList(sK31(sK47))
| ~ ssList(sK32(sK47))
| ~ ssList(sK33(sK47))
| ~ duplicatefreeP(sK47) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax13)]) ).
cnf(g41,plain,
( ~ ssItem(sK29(sK47))
| ~ ssItem(sK30(sK47))
| ~ leq(sK29(sK47),sK30(sK47))
| sPE(sK29(sK47),sK30(sK47))
| lt(sK29(sK47),sK30(sK47)) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax92)]) ).
cnf(g42,plain,
strictorderedP(nil),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax69)]) ).
cnf(g43,plain,
sPE(nil,nil),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g44,plain,
( ~ sPE(nil,nil)
| ~ ssItem(sK51)
| ~ ssList(nil)
| totalorderedP(cons(sK51,nil)) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax67)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWC346+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : satcop --statistics %s
% 0.12/0.33 % Computer : n006.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 : Sun Jun 12 01:43:58 EDT 2022
% 0.12/0.33 % CPUTime :
% 4.02/0.85 % symbols: 81
% 4.02/0.85 % clauses: 275
% 4.02/0.85 % start clauses: 14
% 4.02/0.85 % iterative deepening steps: 274
% 4.02/0.85 % maximum path limit: 2
% 4.02/0.85 % literal attempts: 632635
% 4.02/0.85 % depth failures: 615471
% 4.02/0.85 % regularity failures: 442
% 4.02/0.85 % tautology failures: 3663
% 4.02/0.85 % reductions: 2790
% 4.02/0.85 % extensions: 626200
% 4.02/0.85 % SAT variables: 207490
% 4.02/0.85 % SAT clauses: 199999
% 4.02/0.85 % WalkSAT solutions: 199975
% 4.02/0.85 % CDCL solutions: 18
% 4.02/0.85 % SZS status Theorem for theBenchmark
% 4.02/0.85 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------