TSTP Solution File: CSR026+3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR026+3 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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 : Sat May 4 07:31:21 EDT 2024
% Result : Theorem 8.40s 2.95s
% Output : CNFRefutation 8.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 27 ( 13 unt; 0 def)
% Number of atoms : 47 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 35 ( 15 ~; 12 |; 3 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-1 aty)
% Number of variables : 9 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query126,conjecture,
( mtvisible(c_tptp_spindlecollectormt)
=> tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)) ),
file('/export/starexec/sandbox/tmp/tmp.Jp1iRPQXH6/E---3.1_2609.p',query126) ).
fof(ax2_7997,axiom,
! [X21,X22] :
( ( mtvisible(X21)
& genlmt(X21,X22) )
=> mtvisible(X22) ),
file('/export/starexec/sandbox/tmp/tmp.Jp1iRPQXH6/E---3.1_2609.p',ax2_7997) ).
fof(ax2_142,axiom,
genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox/tmp/tmp.Jp1iRPQXH6/E---3.1_2609.p',ax2_142) ).
fof(ax2_1645,axiom,
genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt),
file('/export/starexec/sandbox/tmp/tmp.Jp1iRPQXH6/E---3.1_2609.p',ax2_1645) ).
fof(ax2_2882,axiom,
genlmt(c_tptp_spindlecollectormt,c_tptp_member3633_mt),
file('/export/starexec/sandbox/tmp/tmp.Jp1iRPQXH6/E---3.1_2609.p',ax2_2882) ).
fof(ax2_4288,axiom,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox/tmp/tmp.Jp1iRPQXH6/E---3.1_2609.p',ax2_4288) ).
fof(ax2_3822,axiom,
! [X2] :
( ( mtvisible(c_tptp_member2701_mt)
& runningshorts(X2) )
=> tptpofobject(X2,f_tptpquantityfn_2(n_756)) ),
file('/export/starexec/sandbox/tmp/tmp.Jp1iRPQXH6/E---3.1_2609.p',ax2_3822) ).
fof(ax2_1317,axiom,
( mtvisible(c_cyclistsmt)
=> runningshorts(c_tptprunningshorts) ),
file('/export/starexec/sandbox/tmp/tmp.Jp1iRPQXH6/E---3.1_2609.p',ax2_1317) ).
fof(c_0_8,negated_conjecture,
~ ( mtvisible(c_tptp_spindlecollectormt)
=> tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)) ),
inference(assume_negation,[status(cth)],[query126]) ).
fof(c_0_9,plain,
! [X5978,X5979] :
( ~ mtvisible(X5978)
| ~ genlmt(X5978,X5979)
| mtvisible(X5979) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_7997])])]) ).
fof(c_0_10,negated_conjecture,
( mtvisible(c_tptp_spindlecollectormt)
& ~ tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])]) ).
cnf(c_0_11,plain,
( mtvisible(X2)
| ~ mtvisible(X1)
| ~ genlmt(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt),
inference(split_conjunct,[status(thm)],[ax2_142]) ).
cnf(c_0_13,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt),
inference(split_conjunct,[status(thm)],[ax2_1645]) ).
cnf(c_0_14,negated_conjecture,
mtvisible(c_tptp_spindlecollectormt),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
genlmt(c_tptp_spindlecollectormt,c_tptp_member3633_mt),
inference(split_conjunct,[status(thm)],[ax2_2882]) ).
cnf(c_0_16,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
inference(split_conjunct,[status(thm)],[ax2_4288]) ).
fof(c_0_17,plain,
! [X1150] :
( ~ mtvisible(c_tptp_member2701_mt)
| ~ runningshorts(X1150)
| tptpofobject(X1150,f_tptpquantityfn_2(n_756)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_3822])])]) ).
fof(c_0_18,plain,
( ~ mtvisible(c_cyclistsmt)
| runningshorts(c_tptprunningshorts) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_1317])]) ).
cnf(c_0_19,plain,
( mtvisible(c_tptp_spindleheadmt)
| ~ mtvisible(c_tptp_member3633_mt) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_20,plain,
mtvisible(c_tptp_member2701_mt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_13]),c_0_14])]) ).
cnf(c_0_21,plain,
mtvisible(c_tptp_member3633_mt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_15]),c_0_14])]) ).
cnf(c_0_22,plain,
( mtvisible(c_cyclistsmt)
| ~ mtvisible(c_tptp_spindleheadmt) ),
inference(spm,[status(thm)],[c_0_11,c_0_16]) ).
cnf(c_0_23,plain,
( tptpofobject(X1,f_tptpquantityfn_2(n_756))
| ~ mtvisible(c_tptp_member2701_mt)
| ~ runningshorts(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( runningshorts(c_tptprunningshorts)
| ~ mtvisible(c_cyclistsmt) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,negated_conjecture,
~ tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_26,plain,
$false,
inference(cdclpropres,[status(thm)],[c_0_19,c_0_20,c_0_21,c_0_22,c_0_23,c_0_24,c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.72/0.85 % Problem : CSR026+3 : TPTP v8.1.2. Released v3.4.0.
% 0.84/0.86 % Command : run_E %s %d THM
% 0.84/1.05 % Computer : n027.cluster.edu
% 0.84/1.05 % Model : x86_64 x86_64
% 0.84/1.05 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.84/1.05 % Memory : 8042.1875MB
% 0.84/1.05 % OS : Linux 3.10.0-693.el7.x86_64
% 0.84/1.05 % CPULimit : 300
% 0.84/1.05 % WCLimit : 300
% 0.84/1.05 % DateTime : Fri May 3 15:16:53 EDT 2024
% 0.84/1.05 % CPUTime :
% 1.64/1.84 Running first-order theorem proving
% 1.64/1.84 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/tmp/tmp.Jp1iRPQXH6/E---3.1_2609.p
% 8.40/2.95 # Version: 3.1.0
% 8.40/2.95 # Preprocessing class: FMLLMMSLSSSNFFN.
% 8.40/2.95 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.40/2.95 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 8.40/2.95 # Starting new_bool_3 with 300s (1) cores
% 8.40/2.95 # Starting new_bool_1 with 300s (1) cores
% 8.40/2.95 # Starting sh5l with 300s (1) cores
% 8.40/2.95 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with pid 2687 completed with status 0
% 8.40/2.95 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y
% 8.40/2.95 # Preprocessing class: FMLLMMSLSSSNFFN.
% 8.40/2.95 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.40/2.95 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 8.40/2.95 # No SInE strategy applied
% 8.40/2.95 # Search class: FHHNM-SMLM31-MFFFFFNN
% 8.40/2.95 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 8.40/2.95 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 901s (1) cores
% 8.40/2.95 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 151s (1) cores
% 8.40/2.95 # Starting new_bool_3 with 151s (1) cores
% 8.40/2.95 # Starting new_bool_1 with 151s (1) cores
% 8.40/2.95 # Starting sh5l with 146s (1) cores
% 8.40/2.95 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with pid 2698 completed with status 0
% 8.40/2.95 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y
% 8.40/2.95 # Preprocessing class: FMLLMMSLSSSNFFN.
% 8.40/2.95 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.40/2.95 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 8.40/2.95 # No SInE strategy applied
% 8.40/2.95 # Search class: FHHNM-SMLM31-MFFFFFNN
% 8.40/2.95 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 8.40/2.95 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 901s (1) cores
% 8.40/2.95 # Preprocessing time : 0.094 s
% 8.40/2.95 # SatCheck found unsatisfiable ground set
% 8.40/2.95
% 8.40/2.95 # Proof found!
% 8.40/2.95 # SZS status Theorem
% 8.40/2.95 # SZS output start CNFRefutation
% See solution above
% 8.40/2.95 # Parsed axioms : 8006
% 8.40/2.95 # Removed by relevancy pruning/SinE : 0
% 8.40/2.95 # Initial clauses : 8007
% 8.40/2.95 # Removed in clause preprocessing : 0
% 8.40/2.95 # Initial clauses in saturation : 8007
% 8.40/2.95 # Processed clauses : 5621
% 8.40/2.95 # ...of these trivial : 318
% 8.40/2.95 # ...subsumed : 303
% 8.40/2.95 # ...remaining for further processing : 5000
% 8.40/2.95 # Other redundant clauses eliminated : 0
% 8.40/2.95 # Clauses deleted for lack of memory : 0
% 8.40/2.95 # Backward-subsumed : 0
% 8.40/2.95 # Backward-rewritten : 23
% 8.40/2.95 # Generated clauses : 14042
% 8.40/2.95 # ...of the previous two non-redundant : 13491
% 8.40/2.95 # ...aggressively subsumed : 0
% 8.40/2.95 # Contextual simplify-reflections : 0
% 8.40/2.95 # Paramodulations : 14042
% 8.40/2.95 # Factorizations : 0
% 8.40/2.95 # NegExts : 0
% 8.40/2.95 # Equation resolutions : 0
% 8.40/2.95 # Disequality decompositions : 0
% 8.40/2.95 # Total rewrite steps : 749
% 8.40/2.95 # ...of those cached : 317
% 8.40/2.95 # Propositional unsat checks : 1
% 8.40/2.95 # Propositional check models : 0
% 8.40/2.95 # Propositional check unsatisfiable : 1
% 8.40/2.95 # Propositional clauses : 20854
% 8.40/2.95 # Propositional clauses after purity: 6023
% 8.40/2.95 # Propositional unsat core size : 7
% 8.40/2.95 # Propositional preprocessing time : 0.000
% 8.40/2.95 # Propositional encoding time : 0.025
% 8.40/2.95 # Propositional solver time : 0.006
% 8.40/2.95 # Success case prop preproc time : 0.000
% 8.40/2.95 # Success case prop encoding time : 0.025
% 8.40/2.95 # Success case prop solver time : 0.006
% 8.40/2.95 # Current number of processed clauses : 4977
% 8.40/2.95 # Positive orientable unit clauses : 2368
% 8.40/2.95 # Positive unorientable unit clauses: 0
% 8.40/2.95 # Negative unit clauses : 33
% 8.40/2.95 # Non-unit-clauses : 2576
% 8.40/2.95 # Current number of unprocessed clauses: 15877
% 8.40/2.95 # ...number of literals in the above : 27614
% 8.40/2.95 # Current number of archived formulas : 0
% 8.40/2.95 # Current number of archived clauses : 23
% 8.40/2.95 # Clause-clause subsumption calls (NU) : 1124915
% 8.40/2.95 # Rec. Clause-clause subsumption calls : 1004194
% 8.40/2.95 # Non-unit clause-clause subsumptions : 303
% 8.40/2.95 # Unit Clause-clause subsumption calls : 14483
% 8.40/2.95 # Rewrite failures with RHS unbound : 0
% 8.40/2.95 # BW rewrite match attempts : 138
% 8.40/2.95 # BW rewrite match successes : 23
% 8.40/2.95 # Condensation attempts : 0
% 8.40/2.95 # Condensation successes : 0
% 8.40/2.95 # Termbank termtop insertions : 450988
% 8.40/2.95 # Search garbage collected termcells : 41047
% 8.40/2.95
% 8.40/2.95 # -------------------------------------------------
% 8.40/2.95 # User time : 0.932 s
% 8.40/2.95 # System time : 0.057 s
% 8.40/2.95 # Total time : 0.989 s
% 8.40/2.95 # Maximum resident set size: 22200 pages
% 8.40/2.95
% 8.40/2.95 # -------------------------------------------------
% 8.40/2.95 # User time : 3.736 s
% 8.40/2.95 # System time : 0.148 s
% 8.40/2.95 # Total time : 3.883 s
% 8.40/2.95 # Maximum resident set size: 8064 pages
% 8.40/2.95 % E---3.1 exiting
% 8.40/2.95 % E exiting
%------------------------------------------------------------------------------