TSTP Solution File: CSR056+2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR056+2 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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:49 EDT 2024
% Result : Theorem 0.46s 0.68s
% Output : CNFRefutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 27 ( 11 unt; 0 def)
% Number of atoms : 49 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 38 ( 16 ~; 13 |; 3 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 17 ( 1 sgn 9 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query106,conjecture,
? [X22] :
( mtvisible(c_tptp_member3717_mt)
=> tptpofobject(c_tptpartsupplies,X22) ),
file('/export/starexec/sandbox2/tmp/tmp.Am6KxID5Ss/E---3.1_3413.p',query106) ).
fof(ax1_1123,axiom,
! [X20,X21] :
( ( mtvisible(X20)
& genlmt(X20,X21) )
=> mtvisible(X21) ),
file('/export/starexec/sandbox2/tmp/tmp.Am6KxID5Ss/E---3.1_3413.p',ax1_1123) ).
fof(ax1_279,axiom,
genlmt(c_tptp_member3717_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox2/tmp/tmp.Am6KxID5Ss/E---3.1_3413.p',ax1_279) ).
fof(ax1_40,axiom,
( mtvisible(c_cyclistsmt)
=> artsupplies(c_tptpartsupplies) ),
file('/export/starexec/sandbox2/tmp/tmp.Am6KxID5Ss/E---3.1_3413.p',ax1_40) ).
fof(ax1_254,axiom,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox2/tmp/tmp.Am6KxID5Ss/E---3.1_3413.p',ax1_254) ).
fof(ax1_202,axiom,
! [X10] :
( ( mtvisible(c_tptp_spindleheadmt)
& supplies(X10) )
=> tptpofobject(X10,f_tptpquantityfn_14(n_232)) ),
file('/export/starexec/sandbox2/tmp/tmp.Am6KxID5Ss/E---3.1_3413.p',ax1_202) ).
fof(ax1_238,axiom,
! [X1] :
( artsupplies(X1)
=> supplies(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.Am6KxID5Ss/E---3.1_3413.p',ax1_238) ).
fof(c_0_7,negated_conjecture,
~ ? [X22] :
( mtvisible(c_tptp_member3717_mt)
=> tptpofobject(c_tptpartsupplies,X22) ),
inference(assume_negation,[status(cth)],[query106]) ).
fof(c_0_8,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)],[ax1_1123])])]) ).
fof(c_0_9,negated_conjecture,
! [X23] :
( mtvisible(c_tptp_member3717_mt)
& ~ tptpofobject(c_tptpartsupplies,X23) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
cnf(c_0_10,plain,
( mtvisible(X2)
| ~ mtvisible(X1)
| ~ genlmt(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
genlmt(c_tptp_member3717_mt,c_tptp_spindleheadmt),
inference(split_conjunct,[status(thm)],[ax1_279]) ).
cnf(c_0_12,negated_conjecture,
mtvisible(c_tptp_member3717_mt),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
( ~ mtvisible(c_cyclistsmt)
| artsupplies(c_tptpartsupplies) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_40])]) ).
cnf(c_0_14,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
inference(split_conjunct,[status(thm)],[ax1_254]) ).
cnf(c_0_15,plain,
mtvisible(c_tptp_spindleheadmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
fof(c_0_16,plain,
! [X26] :
( ~ mtvisible(c_tptp_spindleheadmt)
| ~ supplies(X26)
| tptpofobject(X26,f_tptpquantityfn_14(n_232)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_202])])]) ).
fof(c_0_17,plain,
! [X48] :
( ~ artsupplies(X48)
| supplies(X48) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_238])])]) ).
cnf(c_0_18,plain,
( artsupplies(c_tptpartsupplies)
| ~ mtvisible(c_cyclistsmt) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
mtvisible(c_cyclistsmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_14]),c_0_15])]) ).
cnf(c_0_20,plain,
( tptpofobject(X1,f_tptpquantityfn_14(n_232))
| ~ mtvisible(c_tptp_spindleheadmt)
| ~ supplies(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
( supplies(X1)
| ~ artsupplies(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
artsupplies(c_tptpartsupplies),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).
cnf(c_0_23,negated_conjecture,
~ tptpofobject(c_tptpartsupplies,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_24,plain,
( tptpofobject(X1,f_tptpquantityfn_14(n_232))
| ~ supplies(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_15])]) ).
cnf(c_0_25,plain,
supplies(c_tptpartsupplies),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.19 % Problem : CSR056+2 : TPTP v8.1.2. Released v3.4.0.
% 0.13/0.20 % Command : run_E %s %d THM
% 0.21/0.41 % Computer : n007.cluster.edu
% 0.21/0.41 % Model : x86_64 x86_64
% 0.21/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.41 % Memory : 8042.1875MB
% 0.21/0.41 % OS : Linux 3.10.0-693.el7.x86_64
% 0.21/0.41 % CPULimit : 300
% 0.21/0.41 % WCLimit : 300
% 0.21/0.41 % DateTime : Fri May 3 15:06:53 EDT 2024
% 0.21/0.41 % CPUTime :
% 0.42/0.61 Running first-order theorem proving
% 0.42/0.61 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.Am6KxID5Ss/E---3.1_3413.p
% 0.46/0.68 # Version: 3.1.0
% 0.46/0.68 # Preprocessing class: FMLMSMSLSSSNFFN.
% 0.46/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.46/0.68 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.46/0.68 # Starting new_bool_3 with 600s (2) cores
% 0.46/0.68 # Starting new_bool_1 with 600s (2) cores
% 0.46/0.68 # Starting sh5l with 300s (1) cores
% 0.46/0.68 # sh5l with pid 3599 completed with status 0
% 0.46/0.68 # Result found by sh5l
% 0.46/0.68 # Preprocessing class: FMLMSMSLSSSNFFN.
% 0.46/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.46/0.68 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.46/0.68 # Starting new_bool_3 with 600s (2) cores
% 0.46/0.68 # Starting new_bool_1 with 600s (2) cores
% 0.46/0.68 # Starting sh5l with 300s (1) cores
% 0.46/0.68 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.46/0.68 # Search class: FHHNM-FSLM31-SFFFFFNN
% 0.46/0.68 # partial match(2): FHHNM-SSLM31-MFFFFFNN
% 0.46/0.68 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.46/0.68 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.46/0.68 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 3606 completed with status 0
% 0.46/0.68 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.46/0.68 # Preprocessing class: FMLMSMSLSSSNFFN.
% 0.46/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.46/0.68 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.46/0.68 # Starting new_bool_3 with 600s (2) cores
% 0.46/0.68 # Starting new_bool_1 with 600s (2) cores
% 0.46/0.68 # Starting sh5l with 300s (1) cores
% 0.46/0.68 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.46/0.68 # Search class: FHHNM-FSLM31-SFFFFFNN
% 0.46/0.68 # partial match(2): FHHNM-SSLM31-MFFFFFNN
% 0.46/0.68 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.46/0.68 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.46/0.68 # Preprocessing time : 0.005 s
% 0.46/0.68 # Presaturation interreduction done
% 0.46/0.68
% 0.46/0.68 # Proof found!
% 0.46/0.68 # SZS status Theorem
% 0.46/0.68 # SZS output start CNFRefutation
% See solution above
% 0.46/0.68 # Parsed axioms : 1132
% 0.46/0.68 # Removed by relevancy pruning/SinE : 845
% 0.46/0.68 # Initial clauses : 288
% 0.46/0.68 # Removed in clause preprocessing : 0
% 0.46/0.68 # Initial clauses in saturation : 288
% 0.46/0.68 # Processed clauses : 647
% 0.46/0.68 # ...of these trivial : 8
% 0.46/0.68 # ...subsumed : 9
% 0.46/0.68 # ...remaining for further processing : 630
% 0.46/0.68 # Other redundant clauses eliminated : 0
% 0.46/0.68 # Clauses deleted for lack of memory : 0
% 0.46/0.68 # Backward-subsumed : 1
% 0.46/0.68 # Backward-rewritten : 7
% 0.46/0.68 # Generated clauses : 297
% 0.46/0.68 # ...of the previous two non-redundant : 254
% 0.46/0.68 # ...aggressively subsumed : 0
% 0.46/0.68 # Contextual simplify-reflections : 0
% 0.46/0.68 # Paramodulations : 297
% 0.46/0.68 # Factorizations : 0
% 0.46/0.68 # NegExts : 0
% 0.46/0.68 # Equation resolutions : 0
% 0.46/0.68 # Disequality decompositions : 0
% 0.46/0.68 # Total rewrite steps : 67
% 0.46/0.68 # ...of those cached : 29
% 0.46/0.68 # Propositional unsat checks : 0
% 0.46/0.68 # Propositional check models : 0
% 0.46/0.68 # Propositional check unsatisfiable : 0
% 0.46/0.68 # Propositional clauses : 0
% 0.46/0.68 # Propositional clauses after purity: 0
% 0.46/0.68 # Propositional unsat core size : 0
% 0.46/0.68 # Propositional preprocessing time : 0.000
% 0.46/0.68 # Propositional encoding time : 0.000
% 0.46/0.68 # Propositional solver time : 0.000
% 0.46/0.68 # Success case prop preproc time : 0.000
% 0.46/0.68 # Success case prop encoding time : 0.000
% 0.46/0.68 # Success case prop solver time : 0.000
% 0.46/0.68 # Current number of processed clauses : 344
% 0.46/0.68 # Positive orientable unit clauses : 169
% 0.46/0.68 # Positive unorientable unit clauses: 0
% 0.46/0.68 # Negative unit clauses : 4
% 0.46/0.68 # Non-unit-clauses : 171
% 0.46/0.68 # Current number of unprocessed clauses: 173
% 0.46/0.68 # ...number of literals in the above : 250
% 0.46/0.68 # Current number of archived formulas : 0
% 0.46/0.68 # Current number of archived clauses : 286
% 0.46/0.68 # Clause-clause subsumption calls (NU) : 12326
% 0.46/0.68 # Rec. Clause-clause subsumption calls : 11540
% 0.46/0.68 # Non-unit clause-clause subsumptions : 10
% 0.46/0.68 # Unit Clause-clause subsumption calls : 1380
% 0.46/0.68 # Rewrite failures with RHS unbound : 0
% 0.46/0.68 # BW rewrite match attempts : 5
% 0.46/0.68 # BW rewrite match successes : 5
% 0.46/0.68 # Condensation attempts : 0
% 0.46/0.68 # Condensation successes : 0
% 0.46/0.68 # Termbank termtop insertions : 22668
% 0.46/0.68 # Search garbage collected termcells : 5190
% 0.46/0.68
% 0.46/0.68 # -------------------------------------------------
% 0.46/0.68 # User time : 0.040 s
% 0.46/0.68 # System time : 0.007 s
% 0.46/0.68 # Total time : 0.048 s
% 0.46/0.68 # Maximum resident set size: 4404 pages
% 0.46/0.68
% 0.46/0.68 # -------------------------------------------------
% 0.46/0.68 # User time : 0.055 s
% 0.46/0.68 # System time : 0.010 s
% 0.46/0.68 # Total time : 0.064 s
% 0.46/0.68 # Maximum resident set size: 2660 pages
% 0.46/0.68 % E---3.1 exiting
% 0.46/0.68 % E exiting
%------------------------------------------------------------------------------