TSTP Solution File: CSR062+4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR062+4 : TPTP v8.2.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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 : 300s
% DateTime : Mon May 20 19:13:54 EDT 2024
% Result : Theorem 1.52s 1.21s
% Output : CNFRefutation 1.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 29 ( 10 unt; 0 def)
% Number of atoms : 51 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 41 ( 19 ~; 13 |; 2 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 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 : 29 ( 2 sgn 17 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query212,conjecture,
? [X2] :
( mtvisible(c_tptp_member3205_mt)
=> tptptypes_5_387(X2,c_pushingwithfingers) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query212) ).
fof(ax3_10910,axiom,
! [X2,X3] :
( tptptypes_8_390(X2,X3)
=> tptptypes_7_389(X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+3.ax',ax3_10910) ).
fof(ax3_11228,axiom,
( mtvisible(c_cyclistsmt)
=> tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+3.ax',ax3_11228) ).
fof(ax3_11372,axiom,
! [X2,X3] :
( tptptypes_6_388(X2,X3)
=> tptptypes_5_387(X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+3.ax',ax3_11372) ).
fof(ax3_6493,axiom,
! [X2,X3] :
( tptptypes_7_389(X2,X3)
=> tptptypes_6_388(X3,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+3.ax',ax3_6493) ).
fof(ax3_44208,axiom,
! [X22,X23] :
( ( mtvisible(X22)
& genlmt(X22,X23) )
=> mtvisible(X23) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+3.ax',ax3_44208) ).
fof(ax3_86,axiom,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+3.ax',ax3_86) ).
fof(ax3_6288,axiom,
genlmt(c_tptp_member3205_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+3.ax',ax3_6288) ).
fof(c_0_8,negated_conjecture,
~ ? [X2] :
( mtvisible(c_tptp_member3205_mt)
=> tptptypes_5_387(X2,c_pushingwithfingers) ),
inference(assume_negation,[status(cth)],[query212]) ).
fof(c_0_9,plain,
! [X49,X50] :
( ~ tptptypes_8_390(X49,X50)
| tptptypes_7_389(X49,X50) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_10910])])]) ).
fof(c_0_10,plain,
( ~ mtvisible(c_cyclistsmt)
| tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_11228])]) ).
fof(c_0_11,negated_conjecture,
! [X24] :
( mtvisible(c_tptp_member3205_mt)
& ~ tptptypes_5_387(X24,c_pushingwithfingers) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_12,plain,
! [X25,X26] :
( ~ tptptypes_6_388(X25,X26)
| tptptypes_5_387(X25,X26) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_11372])])]) ).
fof(c_0_13,plain,
! [X35,X36] :
( ~ tptptypes_7_389(X35,X36)
| tptptypes_6_388(X36,X35) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_6493])])]) ).
cnf(c_0_14,plain,
( tptptypes_7_389(X1,X2)
| ~ tptptypes_8_390(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027)
| ~ mtvisible(c_cyclistsmt) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
~ tptptypes_5_387(X1,c_pushingwithfingers),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( tptptypes_5_387(X1,X2)
| ~ tptptypes_6_388(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_18,plain,
! [X33,X34] :
( ~ mtvisible(X33)
| ~ genlmt(X33,X34)
| mtvisible(X34) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_44208])])]) ).
cnf(c_0_19,plain,
( tptptypes_6_388(X2,X1)
| ~ tptptypes_7_389(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( tptptypes_7_389(c_pushingwithfingers,c_tptpcol_15_4027)
| ~ mtvisible(c_cyclistsmt) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,negated_conjecture,
~ tptptypes_6_388(X1,c_pushingwithfingers),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( mtvisible(X2)
| ~ mtvisible(X1)
| ~ genlmt(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
inference(split_conjunct,[status(thm)],[ax3_86]) ).
cnf(c_0_24,plain,
~ mtvisible(c_cyclistsmt),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_25,plain,
genlmt(c_tptp_member3205_mt,c_tptp_spindleheadmt),
inference(split_conjunct,[status(thm)],[ax3_6288]) ).
cnf(c_0_26,negated_conjecture,
mtvisible(c_tptp_member3205_mt),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_27,plain,
~ mtvisible(c_tptp_spindleheadmt),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_28,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_25]),c_0_26])]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR062+4 : TPTP v8.2.0. Released v3.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n010.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 00:41:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.52/1.21 # Version: 3.1.0
% 1.52/1.21 # Preprocessing class: FMLLLMSLSSSNFFN.
% 1.52/1.21 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.52/1.21 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 1.52/1.21 # Starting new_bool_3 with 300s (1) cores
% 1.52/1.21 # Starting new_bool_1 with 300s (1) cores
% 1.52/1.21 # Starting sh5l with 300s (1) cores
% 1.52/1.21 # new_bool_3 with pid 24412 completed with status 0
% 1.52/1.21 # Result found by new_bool_3
% 1.52/1.21 # Preprocessing class: FMLLLMSLSSSNFFN.
% 1.52/1.21 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.52/1.21 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 1.52/1.21 # Starting new_bool_3 with 300s (1) cores
% 1.52/1.21 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.52/1.21 # Search class: FHUNM-FFSM11-SFFFFFNN
% 1.52/1.21 # partial match(1): FHUNM-FFSF11-SFFFFFNN
% 1.52/1.21 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.52/1.21 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.52/1.21 # SAT001_MinMin_p005000_rr_RG with pid 24415 completed with status 0
% 1.52/1.21 # Result found by SAT001_MinMin_p005000_rr_RG
% 1.52/1.21 # Preprocessing class: FMLLLMSLSSSNFFN.
% 1.52/1.21 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.52/1.21 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 1.52/1.21 # Starting new_bool_3 with 300s (1) cores
% 1.52/1.21 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.52/1.21 # Search class: FHUNM-FFSM11-SFFFFFNN
% 1.52/1.21 # partial match(1): FHUNM-FFSF11-SFFFFFNN
% 1.52/1.21 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.52/1.21 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.52/1.21 # Preprocessing time : 0.018 s
% 1.52/1.21 # Presaturation interreduction done
% 1.52/1.21
% 1.52/1.21 # Proof found!
% 1.52/1.21 # SZS status Theorem
% 1.52/1.21 # SZS output start CNFRefutation
% See solution above
% 1.52/1.21 # Parsed axioms : 44217
% 1.52/1.21 # Removed by relevancy pruning/SinE : 44180
% 1.52/1.21 # Initial clauses : 38
% 1.52/1.21 # Removed in clause preprocessing : 0
% 1.52/1.21 # Initial clauses in saturation : 38
% 1.52/1.21 # Processed clauses : 77
% 1.52/1.21 # ...of these trivial : 2
% 1.52/1.21 # ...subsumed : 8
% 1.52/1.21 # ...remaining for further processing : 66
% 1.52/1.21 # Other redundant clauses eliminated : 0
% 1.52/1.21 # Clauses deleted for lack of memory : 0
% 1.52/1.21 # Backward-subsumed : 4
% 1.52/1.21 # Backward-rewritten : 0
% 1.52/1.21 # Generated clauses : 19
% 1.52/1.21 # ...of the previous two non-redundant : 16
% 1.52/1.21 # ...aggressively subsumed : 0
% 1.52/1.21 # Contextual simplify-reflections : 0
% 1.52/1.21 # Paramodulations : 19
% 1.52/1.21 # Factorizations : 0
% 1.52/1.21 # NegExts : 0
% 1.52/1.21 # Equation resolutions : 0
% 1.52/1.21 # Disequality decompositions : 0
% 1.52/1.21 # Total rewrite steps : 7
% 1.52/1.21 # ...of those cached : 3
% 1.52/1.21 # Propositional unsat checks : 0
% 1.52/1.21 # Propositional check models : 0
% 1.52/1.21 # Propositional check unsatisfiable : 0
% 1.52/1.21 # Propositional clauses : 0
% 1.52/1.21 # Propositional clauses after purity: 0
% 1.52/1.21 # Propositional unsat core size : 0
% 1.52/1.21 # Propositional preprocessing time : 0.000
% 1.52/1.21 # Propositional encoding time : 0.000
% 1.52/1.21 # Propositional solver time : 0.000
% 1.52/1.21 # Success case prop preproc time : 0.000
% 1.52/1.21 # Success case prop encoding time : 0.000
% 1.52/1.21 # Success case prop solver time : 0.000
% 1.52/1.21 # Current number of processed clauses : 32
% 1.52/1.21 # Positive orientable unit clauses : 11
% 1.52/1.21 # Positive unorientable unit clauses: 0
% 1.52/1.21 # Negative unit clauses : 4
% 1.52/1.21 # Non-unit-clauses : 17
% 1.52/1.21 # Current number of unprocessed clauses: 5
% 1.52/1.21 # ...number of literals in the above : 10
% 1.52/1.21 # Current number of archived formulas : 0
% 1.52/1.21 # Current number of archived clauses : 34
% 1.52/1.21 # Clause-clause subsumption calls (NU) : 49
% 1.52/1.21 # Rec. Clause-clause subsumption calls : 41
% 1.52/1.21 # Non-unit clause-clause subsumptions : 8
% 1.52/1.21 # Unit Clause-clause subsumption calls : 54
% 1.52/1.21 # Rewrite failures with RHS unbound : 0
% 1.52/1.21 # BW rewrite match attempts : 0
% 1.52/1.21 # BW rewrite match successes : 0
% 1.52/1.21 # Condensation attempts : 0
% 1.52/1.21 # Condensation successes : 0
% 1.52/1.21 # Termbank termtop insertions : 293450
% 1.52/1.21 # Search garbage collected termcells : 157781
% 1.52/1.21
% 1.52/1.21 # -------------------------------------------------
% 1.52/1.21 # User time : 0.141 s
% 1.52/1.21 # System time : 0.068 s
% 1.52/1.21 # Total time : 0.210 s
% 1.52/1.21 # Maximum resident set size: 81076 pages
% 1.52/1.21
% 1.52/1.21 # -------------------------------------------------
% 1.52/1.21 # User time : 0.607 s
% 1.52/1.21 # System time : 0.104 s
% 1.52/1.21 # Total time : 0.711 s
% 1.52/1.21 # Maximum resident set size: 33936 pages
% 1.52/1.21 % E---3.1 exiting
% 1.52/1.21 % E exiting
%------------------------------------------------------------------------------