TSTP Solution File: SWC100+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : SWC100+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n028.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:18 EDT 2022
% Result : Theorem 2.29s 0.65s
% Output : Proof 2.29s
% 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(sK48),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g2,plain,
ssList(sK49),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g3,plain,
ssList(sK50),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g4,plain,
sPE(sK48,sK50),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g5,plain,
sPE(sK47,sK49),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g6,plain,
ssList(sK51),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g7,plain,
sPE(app(sK49,sK51),sK50),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g8,plain,
( ~ sPE(nil,sK49)
| sPE(nil,sK50) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g9,plain,
( sPE(nil,sK48)
| sP0 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g10,plain,
( ~ sPE(nil,sK47)
| sP0 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g11,plain,
( ~ ssList(sK48)
| rearsegP(sK48,nil) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax51)]) ).
cnf(g12,plain,
( ~ ssList(sK49)
| rearsegP(sK49,nil) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax51)]) ).
cnf(g13,plain,
( ~ ssList(sK49)
| frontsegP(sK49,sK49) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax42)]) ).
cnf(g14,plain,
( ~ ssList(sK49)
| frontsegP(sK49,nil) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax45)]) ).
cnf(g15,plain,
( ~ ssList(sK49)
| segmentP(sK49,sK49) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax55)]) ).
cnf(g16,plain,
( ~ ssList(sK49)
| ~ ssList(sK49)
| ~ segmentP(sK49,sK49)
| ~ segmentP(sK49,sK49)
| sPE(sK49,sK49) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax54)]) ).
cnf(g17,plain,
( ~ sPE(sK49,sK49)
| ~ neq(sK49,sK49)
| ~ ssList(sK49)
| ~ ssList(sK49) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax15)]) ).
cnf(g18,plain,
( ~ ssList(sK50)
| ~ ssList(sK49)
| ~ frontsegP(sK50,sK49)
| ~ frontsegP(sK49,sK50)
| sPE(sK50,sK49) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax41)]) ).
cnf(g19,plain,
( ~ ssList(sK49)
| ~ ssList(sK50)
| ~ rearsegP(sK49,sK50)
| ~ rearsegP(sK50,sK49)
| sPE(sK49,sK50) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax48)]) ).
cnf(g20,plain,
( ~ sPE(nil,sK50)
| ~ ssList(sK50)
| frontsegP(nil,sK50) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax46)]) ).
cnf(g21,plain,
( ~ sPE(sK48,sK50)
| sPE(sK50,sK48) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g22,plain,
( ~ sPE(sK48,sK50)
| ~ sPE(sK50,sK49)
| sPE(sK48,sK49) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g23,plain,
( ~ sPE(sK47,sK49)
| sPE(sK49,sK47) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g24,plain,
( ~ ssList(sK49)
| ~ ssList(sK49)
| ~ ssList(sK51)
| ~ frontsegP(sK49,sK49)
| frontsegP(app(sK49,sK51),sK49) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax43)]) ).
cnf(g25,plain,
( ~ sPE(app(sK49,sK51),sK50)
| ~ sPE(sK49,sK49)
| ~ frontsegP(app(sK49,sK51),sK49)
| frontsegP(sK50,sK49) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g26,plain,
( ~ sPE(sK49,sK49)
| ~ sPE(nil,sK50)
| ~ rearsegP(sK49,nil)
| rearsegP(sK49,sK50) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g27,plain,
( neq(sK48,nil)
| ~ sP0 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g28,plain,
( ~ neq(sK47,nil)
| ~ frontsegP(sK48,sK47)
| ~ sP0 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g29,plain,
ssList(nil),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax17)]) ).
cnf(g30,plain,
( ~ sPE(nil,sK48)
| ~ sPE(sK48,sK49)
| sPE(nil,sK49) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g31,plain,
( ~ ssList(sK49)
| ~ ssList(nil)
| ~ ssList(sK50)
| ~ frontsegP(sK49,nil)
| ~ frontsegP(nil,sK50)
| frontsegP(sK49,sK50) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax40)]) ).
cnf(g32,plain,
( ~ sPE(sK49,sK50)
| sPE(sK50,sK49) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g33,plain,
( ~ sPE(nil,sK48)
| ~ sPE(sK48,sK50)
| sPE(nil,sK50) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g34,plain,
( ~ sPE(sK50,sK48)
| ~ sPE(sK49,sK49)
| ~ frontsegP(sK50,sK49)
| frontsegP(sK48,sK49) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g35,plain,
( ~ sPE(sK48,sK50)
| ~ sPE(nil,sK49)
| ~ rearsegP(sK48,nil)
| rearsegP(sK50,sK49) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g36,plain,
( ~ sPE(nil,sK47)
| ~ sPE(sK47,sK49)
| sPE(nil,sK49) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g37,plain,
( ~ sPE(nil,sK49)
| ~ sPE(sK49,sK47)
| sPE(nil,sK47) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g38,plain,
( ~ sPE(sK47,nil)
| sPE(nil,sK47) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g39,plain,
( ~ sPE(sK49,sK49)
| ~ sPE(sK49,sK47)
| ~ frontsegP(sK49,sK49)
| frontsegP(sK49,sK47) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g40,plain,
( ~ ssList(sK47)
| ~ ssList(nil)
| sPE(sK47,nil)
| neq(sK47,nil) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax15)]) ).
cnf(g41,plain,
( ~ ssList(sK48)
| ~ ssList(sK49)
| ~ ssList(sK47)
| ~ frontsegP(sK48,sK49)
| ~ frontsegP(sK49,sK47)
| frontsegP(sK48,sK47) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax40)]) ).
cnf(g42,plain,
( ~ sPE(sK48,sK49)
| ~ sPE(nil,sK49)
| ~ neq(sK48,nil)
| neq(sK49,sK49) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC100+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.12 % Command : satcop --statistics %s
% 0.12/0.33 % Computer : n028.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 16:11:51 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.29/0.65 % symbols: 79
% 2.29/0.65 % clauses: 274
% 2.29/0.65 % start clauses: 13
% 2.29/0.65 % iterative deepening steps: 154
% 2.29/0.65 % maximum path limit: 2
% 2.29/0.65 % literal attempts: 357688
% 2.29/0.65 % depth failures: 351076
% 2.29/0.65 % regularity failures: 213
% 2.29/0.65 % tautology failures: 1220
% 2.29/0.65 % reductions: 489
% 2.29/0.65 % extensions: 355324
% 2.29/0.65 % SAT variables: 145658
% 2.29/0.65 % SAT clauses: 138337
% 2.29/0.65 % WalkSAT solutions: 138331
% 2.29/0.65 % CDCL solutions: 6
% 2.29/0.65 % SZS status Theorem for theBenchmark
% 2.29/0.65 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------