TSTP Solution File: SWC369+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : SWC369+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n032.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:56 EDT 2022
% Result : Theorem 0.11s 0.38s
% Output : Proof 0.11s
% 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,
ssList(sK50),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g4,plain,
sPE(sK48,sK50),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g5,plain,
sPE(sK47,sK49),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g6,plain,
~ segmentP(sK48,sK47),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g7,plain,
( ~ sPE(nil,sK50)
| sPE(nil,sK49) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g8,plain,
( ~ neq(sK50,nil)
| segmentP(sK50,sK49) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g9,plain,
( ~ ssList(sK50)
| ~ ssList(sK47)
| sPE(sK50,sK47)
| neq(sK50,sK47) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax15)]) ).
cnf(g10,plain,
( ~ ssList(sK47)
| frontsegP(sK47,nil) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax45)]) ).
cnf(g11,plain,
( ~ sPE(sK50,sK49)
| ~ neq(sK50,sK49)
| ~ ssList(sK50)
| ~ ssList(sK49) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax15)]) ).
cnf(g12,plain,
( ~ ssList(sK50)
| ~ ssList(sK49)
| ~ frontsegP(sK50,sK49)
| ~ frontsegP(sK49,sK50)
| sPE(sK50,sK49) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax41)]) ).
cnf(g13,plain,
( ~ ssList(sK50)
| frontsegP(sK50,nil) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax45)]) ).
cnf(g14,plain,
( ~ ssList(sK50)
| rearsegP(sK50,sK50) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax49)]) ).
cnf(g15,plain,
( ~ ssList(sK50)
| ~ ssList(sK50)
| ~ rearsegP(sK50,sK50)
| ~ rearsegP(sK50,sK50)
| sPE(sK50,sK50) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax48)]) ).
cnf(g16,plain,
( ~ ssList(sK50)
| segmentP(sK50,sK50) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax55)]) ).
cnf(g17,plain,
( ~ sPE(sK48,sK50)
| sPE(sK50,sK48) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g18,plain,
( ~ sPE(sK47,sK49)
| sPE(sK49,sK47) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g19,plain,
( ~ sPE(sK50,sK50)
| ~ sPE(sK47,sK49)
| ~ neq(sK50,sK47)
| neq(sK50,sK49) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g20,plain,
( ~ ssList(sK48)
| ~ ssList(sK50)
| ~ ssList(sK47)
| ~ segmentP(sK48,sK50)
| ~ segmentP(sK50,sK47)
| segmentP(sK48,sK47) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax53)]) ).
cnf(g21,plain,
( ~ sPE(sK50,sK48)
| ~ sPE(sK50,sK47)
| ~ segmentP(sK50,sK50)
| segmentP(sK48,sK47) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g22,plain,
( ~ sPE(sK50,nil)
| sPE(nil,sK50) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g23,plain,
( ~ ssList(sK50)
| ~ ssList(nil)
| sPE(sK50,nil)
| neq(sK50,nil) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax15)]) ).
cnf(g24,plain,
ssList(nil),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax17)]) ).
cnf(g25,plain,
( ~ sPE(sK50,sK50)
| ~ sPE(nil,sK49)
| ~ frontsegP(sK50,nil)
| frontsegP(sK50,sK49) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g26,plain,
( ~ sPE(sK50,sK48)
| ~ sPE(sK50,sK50)
| ~ segmentP(sK50,sK50)
| segmentP(sK48,sK50) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g27,plain,
( ~ sPE(sK47,sK49)
| ~ sPE(nil,sK50)
| ~ frontsegP(sK47,nil)
| frontsegP(sK49,sK50) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g28,plain,
( ~ sPE(sK50,sK50)
| ~ sPE(sK49,sK47)
| ~ segmentP(sK50,sK49)
| segmentP(sK50,sK47) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SWC369+1 : TPTP v8.1.0. Released v2.4.0.
% 0.00/0.08 % Command : satcop --statistics %s
% 0.07/0.26 % Computer : n032.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 600
% 0.07/0.27 % DateTime : Sun Jun 12 20:17:26 EDT 2022
% 0.07/0.27 % CPUTime :
% 0.11/0.38 % symbols: 77
% 0.11/0.38 % clauses: 269
% 0.11/0.38 % start clauses: 10
% 0.11/0.38 % iterative deepening steps: 41
% 0.11/0.38 % maximum path limit: 2
% 0.11/0.38 % literal attempts: 122674
% 0.11/0.38 % depth failures: 119066
% 0.11/0.38 % regularity failures: 89
% 0.11/0.38 % tautology failures: 897
% 0.11/0.38 % reductions: 443
% 0.11/0.38 % extensions: 121909
% 0.11/0.38 % SAT variables: 79566
% 0.11/0.38 % SAT clauses: 76327
% 0.11/0.38 % WalkSAT solutions: 76319
% 0.11/0.38 % CDCL solutions: 2
% 0.11/0.38 % SZS status Theorem for theBenchmark
% 0.11/0.38 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------