TSTP Solution File: CSR023+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : CSR023+1 : TPTP v8.1.0. Bugfixed v3.1.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 : Fri Jul 15 23:15:00 EDT 2022
% Result : Theorem 0.19s 0.41s
% Output : Proof 0.19s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ holdsAt(spinning,n3),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',spinning_3)]) ).
cnf(g1,plain,
sPE(spinning,spinning),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g2,plain,
sPE(push,push),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g3,plain,
sPE(pull,pull),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g4,plain,
( ~ sPE(pull,pull)
| ~ sPE(n2,n2)
| happens(pull,n2) ),
inference(ground_cnf,[],[file('Axioms/CSR001+2.ax',happens_all_defn)]) ).
cnf(g5,plain,
sPE(n2,n2),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g6,plain,
( ~ sPE(spinning,spinning)
| ~ sPE(plus(n2,n1),n3)
| ~ holdsAt(spinning,plus(n2,n1))
| holdsAt(spinning,n3) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g7,plain,
( ~ happens(pull,n2)
| ~ initiates(pull,spinning,n2)
| holdsAt(spinning,plus(n2,n1)) ),
inference(ground_cnf,[],[file('Axioms/CSR001+0.ax',happens_holds)]) ).
cnf(g8,plain,
( ~ sPE(pull,pull)
| ~ sPE(spinning,spinning)
| ~ happens(push,n2)
| initiates(pull,spinning,n2) ),
inference(ground_cnf,[],[file('Axioms/CSR001+2.ax',initiates_all_defn)]) ).
cnf(g9,plain,
( ~ sPE(push,push)
| ~ sPE(n2,n2)
| happens(push,n2) ),
inference(ground_cnf,[],[file('Axioms/CSR001+2.ax',happens_all_defn)]) ).
cnf(g10,plain,
( ~ sPE(plus(n2,n1),plus(n1,n2))
| ~ sPE(plus(n1,n2),n3)
| sPE(plus(n2,n1),n3) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
sPE(plus(n2,n1),plus(n1,n2)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_plus)]) ).
cnf(g12,plain,
sPE(plus(n1,n2),n3),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus1_2)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR023+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.03/0.13 % Command : satcop --statistics %s
% 0.12/0.34 % Computer : n028.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 9 19:26:33 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.41 % symbols: 48
% 0.19/0.41 % clauses: 153
% 0.19/0.41 % start clauses: 1
% 0.19/0.41 % iterative deepening steps: 171
% 0.19/0.41 % maximum path limit: 4
% 0.19/0.41 % literal attempts: 67298
% 0.19/0.41 % depth failures: 53092
% 0.19/0.41 % regularity failures: 4369
% 0.19/0.41 % tautology failures: 1124
% 0.19/0.41 % reductions: 95
% 0.19/0.41 % extensions: 67073
% 0.19/0.41 % SAT variables: 12964
% 0.19/0.41 % SAT clauses: 14818
% 0.19/0.41 % WalkSAT solutions: 14812
% 0.19/0.41 % CDCL solutions: 0
% 0.19/0.41 % SZS status Theorem for theBenchmark
% 0.19/0.41 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------