TSTP Solution File: SWC146+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : SWC146+1 : TPTP v8.1.0. Released v2.4.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 : Tue Jul 19 21:54:36 EDT 2022
% Result : Theorem 1.33s 0.57s
% Output : Proof 1.33s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
ssList(sK48),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g1,plain,
ssList(sK50),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g2,plain,
sPE(sK48,sK50),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g3,plain,
neq(sK48,nil),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g4,plain,
~ neq(sK50,nil),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g5,plain,
( ~ ssList(sK48)
| segmentP(sK48,sK48) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax55)]) ).
cnf(g6,plain,
( ~ ssList(sK48)
| ~ ssList(sK48)
| ~ segmentP(sK48,sK48)
| sPE(app(app(sK7(sK48,sK48),sK48),sK8(sK48,sK48)),sK48) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax7)]) ).
cnf(g7,plain,
( ~ ssList(sK48)
| frontsegP(sK48,sK48) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax42)]) ).
cnf(g8,plain,
( ~ ssList(sK48)
| frontsegP(sK48,nil) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax45)]) ).
cnf(g9,plain,
( ~ sPE(nil,sK50)
| ~ ssList(sK50)
| frontsegP(nil,sK50) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax46)]) ).
cnf(g10,plain,
( ~ sPE(sK48,sK50)
| ~ sPE(sK48,sK48)
| ~ frontsegP(sK48,sK48)
| frontsegP(sK50,sK48) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
( ~ sPE(sK48,nil)
| ~ neq(sK48,nil)
| ~ ssList(sK48)
| ~ ssList(nil) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax15)]) ).
cnf(g12,plain,
( ~ ssList(sK50)
| ~ ssList(nil)
| sPE(sK50,nil)
| neq(sK50,nil) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax15)]) ).
cnf(g13,plain,
( ~ sPE(app(app(sK7(sK48,sK48),sK48),sK8(sK48,sK48)),sK48)
| sPE(sK48,app(app(sK7(sK48,sK48),sK48),sK8(sK48,sK48))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g14,plain,
( ~ sPE(sK48,app(app(sK7(sK48,sK48),sK48),sK8(sK48,sK48)))
| ~ sPE(app(app(sK7(sK48,sK48),sK48),sK8(sK48,sK48)),sK48)
| sPE(sK48,sK48) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g15,plain,
ssList(nil),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax17)]) ).
cnf(g16,plain,
( ~ ssList(sK48)
| ~ ssList(nil)
| ~ frontsegP(sK48,nil)
| ~ frontsegP(nil,sK48)
| sPE(sK48,nil) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax41)]) ).
cnf(g17,plain,
( ~ sPE(sK50,nil)
| sPE(nil,sK50) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g18,plain,
( ~ ssList(nil)
| ~ ssList(sK50)
| ~ ssList(sK48)
| ~ frontsegP(nil,sK50)
| ~ frontsegP(sK50,sK48)
| frontsegP(nil,sK48) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax40)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC146+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : satcop --statistics %s
% 0.13/0.33 % Computer : n015.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 12 07:21:21 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.33/0.57 % symbols: 77
% 1.33/0.57 % clauses: 268
% 1.33/0.57 % start clauses: 9
% 1.33/0.57 % iterative deepening steps: 24
% 1.33/0.57 % maximum path limit: 1
% 1.33/0.57 % literal attempts: 72415
% 1.33/0.57 % depth failures: 69843
% 1.33/0.57 % regularity failures: 43
% 1.33/0.57 % tautology failures: 707
% 1.33/0.57 % reductions: 378
% 1.33/0.57 % extensions: 71887
% 1.33/0.57 % SAT variables: 37655
% 1.33/0.57 % SAT clauses: 41748
% 1.33/0.57 % WalkSAT solutions: 41738
% 1.33/0.57 % CDCL solutions: 2
% 1.33/0.57 % SZS status Theorem for theBenchmark
% 1.33/0.57 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------