TSTP Solution File: CSR062+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR062+4 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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 02:47:15 EDT 2022
% Result : Theorem 10.79s 3.87s
% Output : CNFRefutation 10.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 24 ( 14 unt; 0 nHn; 24 RR)
% Number of literals : 36 ( 0 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 20 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_2177,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zl6uw2fq/input.p',i_0_2177) ).
cnf(i_0_279,plain,
genlmt(c_tptp_member3205_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zl6uw2fq/input.p',i_0_279) ).
cnf(i_0_2523,negated_conjecture,
mtvisible(c_tptp_member3205_mt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zl6uw2fq/input.p',i_0_2523) ).
cnf(i_0_489,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zl6uw2fq/input.p',i_0_489) ).
cnf(i_0_2522,negated_conjecture,
~ tptptypes_5_387(X1,c_pushingwithfingers),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zl6uw2fq/input.p',i_0_2522) ).
cnf(i_0_70,plain,
( tptptypes_5_387(X1,X2)
| ~ tptptypes_6_388(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zl6uw2fq/input.p',i_0_70) ).
cnf(i_0_60,plain,
( tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027)
| ~ mtvisible(c_cyclistsmt) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zl6uw2fq/input.p',i_0_60) ).
cnf(i_0_130,plain,
( tptptypes_6_388(X1,X2)
| ~ tptptypes_7_389(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zl6uw2fq/input.p',i_0_130) ).
cnf(i_0_47,plain,
( tptptypes_7_389(X1,X2)
| ~ tptptypes_8_390(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zl6uw2fq/input.p',i_0_47) ).
cnf(c_0_2533,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
i_0_2177 ).
cnf(c_0_2534,plain,
genlmt(c_tptp_member3205_mt,c_tptp_spindleheadmt),
i_0_279 ).
cnf(c_0_2535,negated_conjecture,
mtvisible(c_tptp_member3205_mt),
i_0_2523 ).
cnf(c_0_2536,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
i_0_489 ).
cnf(c_0_2537,plain,
mtvisible(c_tptp_spindleheadmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2533,c_0_2534]),c_0_2535])]) ).
cnf(c_0_2538,negated_conjecture,
~ tptptypes_5_387(X1,c_pushingwithfingers),
i_0_2522 ).
cnf(c_0_2539,plain,
( tptptypes_5_387(X1,X2)
| ~ tptptypes_6_388(X1,X2) ),
i_0_70 ).
cnf(c_0_2540,plain,
( tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027)
| ~ mtvisible(c_cyclistsmt) ),
i_0_60 ).
cnf(c_0_2541,plain,
mtvisible(c_cyclistsmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2533,c_0_2536]),c_0_2537])]) ).
cnf(c_0_2542,negated_conjecture,
~ tptptypes_6_388(X1,c_pushingwithfingers),
inference(spm,[status(thm)],[c_0_2538,c_0_2539]) ).
cnf(c_0_2543,plain,
( tptptypes_6_388(X1,X2)
| ~ tptptypes_7_389(X2,X1) ),
i_0_130 ).
cnf(c_0_2544,plain,
( tptptypes_7_389(X1,X2)
| ~ tptptypes_8_390(X1,X2) ),
i_0_47 ).
cnf(c_0_2545,plain,
tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_2540,c_0_2541])]) ).
cnf(c_0_2546,plain,
~ tptptypes_7_389(c_pushingwithfingers,X1),
inference(spm,[status(thm)],[c_0_2542,c_0_2543]) ).
cnf(c_0_2547,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_2544,c_0_2545]),c_0_2546]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : CSR062+4 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n029.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 : Fri Jun 10 03:46:24 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.43 # ENIGMATIC: Selected SinE mode:
% 0.80/1.03 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.80/1.03 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.80/1.03 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.80/1.03 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 10.79/3.87 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 10.79/3.87 # Version: 2.1pre011
% 10.79/3.87 # Preprocessing time : 0.057 s
% 10.79/3.87
% 10.79/3.87 # Proof found!
% 10.79/3.87 # SZS status Theorem
% 10.79/3.87 # SZS output start CNFRefutation
% See solution above
% 10.79/3.87 # Proof object total steps : 24
% 10.79/3.87 # Proof object clause steps : 15
% 10.79/3.87 # Proof object formula steps : 9
% 10.79/3.87 # Proof object conjectures : 5
% 10.79/3.87 # Proof object clause conjectures : 3
% 10.79/3.87 # Proof object formula conjectures : 2
% 10.79/3.87 # Proof object initial clauses used : 9
% 10.79/3.87 # Proof object initial formulas used : 9
% 10.79/3.87 # Proof object generating inferences : 5
% 10.79/3.87 # Proof object simplifying inferences : 7
% 10.79/3.87 # Training examples: 0 positive, 0 negative
% 10.79/3.87 # Parsed axioms : 2522
% 10.79/3.87 # Removed by relevancy pruning/SinE : 0
% 10.79/3.87 # Initial clauses : 2522
% 10.79/3.87 # Removed in clause preprocessing : 0
% 10.79/3.87 # Initial clauses in saturation : 2522
% 10.79/3.87 # Processed clauses : 2920
% 10.79/3.87 # ...of these trivial : 172
% 10.79/3.87 # ...subsumed : 73
% 10.79/3.87 # ...remaining for further processing : 2675
% 10.79/3.87 # Other redundant clauses eliminated : 2
% 10.79/3.87 # Clauses deleted for lack of memory : 0
% 10.79/3.87 # Backward-subsumed : 5
% 10.79/3.87 # Backward-rewritten : 85
% 10.79/3.87 # Generated clauses : 6008
% 10.79/3.87 # ...of the previous two non-trivial : 5162
% 10.79/3.87 # Contextual simplify-reflections : 5
% 10.79/3.87 # Paramodulations : 6006
% 10.79/3.87 # Factorizations : 0
% 10.79/3.87 # Equation resolutions : 2
% 10.79/3.87 # Propositional unsat checks : 0
% 10.79/3.87 # Propositional unsat check successes : 0
% 10.79/3.87 # Current number of processed clauses : 2583
% 10.79/3.87 # Positive orientable unit clauses : 1496
% 10.79/3.87 # Positive unorientable unit clauses: 0
% 10.79/3.87 # Negative unit clauses : 87
% 10.79/3.87 # Non-unit-clauses : 1000
% 10.79/3.87 # Current number of unprocessed clauses: 4629
% 10.79/3.87 # ...number of literals in the above : 8333
% 10.79/3.87 # Current number of archived formulas : 0
% 10.79/3.87 # Current number of archived clauses : 90
% 10.79/3.87 # Clause-clause subsumption calls (NU) : 119050
% 10.79/3.87 # Rec. Clause-clause subsumption calls : 101874
% 10.79/3.87 # Non-unit clause-clause subsumptions : 79
% 10.79/3.87 # Unit Clause-clause subsumption calls : 69420
% 10.79/3.87 # Rewrite failures with RHS unbound : 0
% 10.79/3.87 # BW rewrite match attempts : 2391
% 10.79/3.87 # BW rewrite match successes : 22
% 10.79/3.87 # Condensation attempts : 0
% 10.79/3.87 # Condensation successes : 0
% 10.79/3.87 # Termbank termtop insertions : 95551
% 10.79/3.87
% 10.79/3.87 # -------------------------------------------------
% 10.79/3.87 # User time : 0.215 s
% 10.79/3.87 # System time : 0.009 s
% 10.79/3.87 # Total time : 0.224 s
% 10.79/3.87 # ...preprocessing : 0.057 s
% 10.79/3.87 # ...main loop : 0.167 s
% 10.79/3.87 # Maximum resident set size: 21864 pages
% 10.79/3.87
%------------------------------------------------------------------------------