TSTP Solution File: SWC366-1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : SWC366-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:55:55 EDT 2022
% Result : Unsatisfiable 212.73s 27.20s
% Output : Proof 213.33s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
ssList(sk2),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2)]) ).
cnf(g1,plain,
ssList(sk3),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_3)]) ).
cnf(g2,plain,
ssList(sk4),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_4)]) ).
cnf(g3,plain,
sPE(sk2,sk4),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5)]) ).
cnf(g4,plain,
sPE(sk1,sk3),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6)]) ).
cnf(g5,plain,
neq(sk2,nil),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7)]) ).
cnf(g6,plain,
( ~ rearsegP(sk2,sk1)
| ~ neq(sk4,nil) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12)]) ).
cnf(g7,plain,
( ~ sPE(sk2,nil)
| ~ ssList(sk2)
| ~ ssList(nil)
| ~ neq(sk2,nil) ),
inference(ground_cnf,[],[file('Axioms/SWC001-0.ax',clause115)]) ).
cnf(g8,plain,
( ~ ssList(sk4)
| sPE(nil,sk4)
| ssItem(hd(sk4)) ),
inference(ground_cnf,[],[file('Axioms/SWC001-0.ax',clause76)]) ).
cnf(g9,plain,
( ~ ssList(sk4)
| ~ ssList(nil)
| sPE(nil,sk4)
| neq(nil,sk4) ),
inference(ground_cnf,[],[file('Axioms/SWC001-0.ax',clause100)]) ).
cnf(g10,plain,
( ~ sPE(sk2,sk4)
| ~ sPE(nil,nil)
| ~ neq(sk2,nil)
| neq(sk4,nil) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
( ~ sPE(sk2,sk4)
| sPE(sk4,sk2) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g12,plain,
( ~ sPE(sk2,sk4)
| ~ sPE(sk4,nil)
| sPE(sk2,nil) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g13,plain,
( ~ sPE(sk1,sk3)
| sPE(sk3,sk1) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g14,plain,
sPE(hd(sk4),hd(sk4)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g15,plain,
sPE(cons(hd(sk4),nil),cons(hd(sk4),nil)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g16,plain,
ssList(nil),
inference(ground_cnf,[],[file('Axioms/SWC001-0.ax',clause8)]) ).
cnf(g17,plain,
( ~ ssList(nil)
| ~ ssItem(hd(sk4))
| ssList(cons(hd(sk4),nil)) ),
inference(ground_cnf,[],[file('Axioms/SWC001-0.ax',clause86)]) ).
cnf(g18,plain,
sPE(app(cons(hd(sk4),nil),sk3),app(cons(hd(sk4),nil),sk3)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g19,plain,
( ~ sPE(cons(hd(sk4),nil),cons(hd(sk4),nil))
| ~ sPE(app(cons(hd(sk4),nil),sk3),app(cons(hd(sk4),nil),sk3))
| ~ sPE(hd(sk4),hd(sk4))
| ~ ssList(app(cons(hd(sk4),nil),sk3))
| ~ ssList(cons(hd(sk4),nil))
| ~ ssItem(hd(sk4))
| ~ neq(nil,sk4)
| ~ neq(sk4,nil)
| sPE(sk4,app(cons(hd(sk4),nil),sk3)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11)]) ).
cnf(g20,plain,
( ~ ssList(sk3)
| ~ ssList(cons(hd(sk4),nil))
| ssList(app(cons(hd(sk4),nil),sk3)) ),
inference(ground_cnf,[],[file('Axioms/SWC001-0.ax',clause85)]) ).
cnf(g21,plain,
( ~ sPE(sk4,app(cons(hd(sk4),nil),sk3))
| sPE(app(cons(hd(sk4),nil),sk3),sk4) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g22,plain,
( ~ ssList(nil)
| segmentP(nil,nil) ),
inference(ground_cnf,[],[file('Axioms/SWC001-0.ax',clause56)]) ).
cnf(g23,plain,
( ~ ssList(nil)
| ~ segmentP(nil,nil)
| sPE(nil,nil) ),
inference(ground_cnf,[],[file('Axioms/SWC001-0.ax',clause80)]) ).
cnf(g24,plain,
( ~ sPE(nil,sk4)
| sPE(sk4,nil) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g25,plain,
( ~ sPE(app(cons(hd(sk4),nil),sk3),sk4)
| ~ ssList(cons(hd(sk4),nil))
| ~ ssList(sk3)
| ~ ssList(sk4)
| rearsegP(sk4,sk3) ),
inference(ground_cnf,[],[file('Axioms/SWC001-0.ax',clause143)]) ).
cnf(g26,plain,
( ~ sPE(sk4,sk2)
| ~ sPE(sk3,sk1)
| ~ rearsegP(sk4,sk3)
| rearsegP(sk2,sk1) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWC366-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : satcop --statistics %s
% 0.13/0.33 % Computer : n028.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 : Sat Jun 11 20:14:20 EDT 2022
% 0.13/0.33 % CPUTime :
% 212.73/27.20 % symbols: 74
% 212.73/27.20 % clauses: 265
% 212.73/27.20 % start clauses: 12
% 212.73/27.20 % iterative deepening steps: 3108
% 212.73/27.20 % maximum path limit: 3
% 212.73/27.20 % literal attempts: 86821559
% 212.73/27.20 % depth failures: 83266031
% 212.73/27.20 % regularity failures: 318064
% 212.73/27.20 % tautology failures: 1135110
% 212.73/27.20 % reductions: 159172
% 212.73/27.20 % extensions: 86631293
% 212.73/27.20 % SAT variables: 7775968
% 212.73/27.20 % SAT clauses: 7479666
% 212.73/27.20 % WalkSAT solutions: 7479630
% 212.73/27.20 % CDCL solutions: 32
% 212.73/27.20 % SZS status Unsatisfiable for theBenchmark
% 212.73/27.20 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------