TSTP Solution File: CSR062+2 by E-SAT---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.2.0
% Problem : CSR062+2 : TPTP v8.2.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d SAT
% 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 : Mon Jun 24 05:08:45 EDT 2024
% Result : Theorem 0.41s 0.54s
% Output : CNFRefutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 30 ( 11 unt; 0 def)
% Number of atoms : 52 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 39 ( 17 ~; 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 : 31 ( 2 sgn 17 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query112,conjecture,
? [X5] :
( mtvisible(c_tptp_member3205_mt)
=> tptptypes_5_387(X5,c_pushingwithfingers) ),
file('/export/starexec/sandbox2/tmp/tmp.qv50MTLGDL/E---3.1_14012.p',query112) ).
fof(ax1_1123,axiom,
! [X20,X21] :
( ( mtvisible(X20)
& genlmt(X20,X21) )
=> mtvisible(X21) ),
file('/export/starexec/sandbox2/tmp/tmp.qv50MTLGDL/E---3.1_14012.p',ax1_1123) ).
fof(ax1_34,axiom,
genlmt(c_tptp_member3205_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox2/tmp/tmp.qv50MTLGDL/E---3.1_14012.p',ax1_34) ).
fof(ax1_302,axiom,
! [X5,X6] :
( tptptypes_7_389(X5,X6)
=> tptptypes_6_388(X6,X5) ),
file('/export/starexec/sandbox2/tmp/tmp.qv50MTLGDL/E---3.1_14012.p',ax1_302) ).
fof(ax1_61,axiom,
! [X5,X6] :
( tptptypes_8_390(X5,X6)
=> tptptypes_7_389(X5,X6) ),
file('/export/starexec/sandbox2/tmp/tmp.qv50MTLGDL/E---3.1_14012.p',ax1_61) ).
fof(ax1_460,axiom,
( mtvisible(c_cyclistsmt)
=> tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027) ),
file('/export/starexec/sandbox2/tmp/tmp.qv50MTLGDL/E---3.1_14012.p',ax1_460) ).
fof(ax1_254,axiom,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox2/tmp/tmp.qv50MTLGDL/E---3.1_14012.p',ax1_254) ).
fof(ax1_99,axiom,
! [X5,X6] :
( tptptypes_6_388(X5,X6)
=> tptptypes_5_387(X5,X6) ),
file('/export/starexec/sandbox2/tmp/tmp.qv50MTLGDL/E---3.1_14012.p',ax1_99) ).
fof(c_0_8,negated_conjecture,
~ ? [X5] :
( mtvisible(c_tptp_member3205_mt)
=> tptptypes_5_387(X5,c_pushingwithfingers) ),
inference(assume_negation,[status(cth)],[query112]) ).
fof(c_0_9,plain,
! [X29,X30] :
( ~ mtvisible(X29)
| ~ genlmt(X29,X30)
| mtvisible(X30) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_1123])])]) ).
fof(c_0_10,negated_conjecture,
! [X22] :
( mtvisible(c_tptp_member3205_mt)
& ~ tptptypes_5_387(X22,c_pushingwithfingers) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[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_member3205_mt,c_tptp_spindleheadmt),
inference(split_conjunct,[status(thm)],[ax1_34]) ).
cnf(c_0_13,negated_conjecture,
mtvisible(c_tptp_member3205_mt),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
! [X31,X32] :
( ~ tptptypes_7_389(X31,X32)
| tptptypes_6_388(X32,X31) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_302])])]) ).
fof(c_0_15,plain,
! [X39,X40] :
( ~ tptptypes_8_390(X39,X40)
| tptptypes_7_389(X39,X40) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_61])])]) ).
fof(c_0_16,plain,
( ~ mtvisible(c_cyclistsmt)
| tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_460])]) ).
cnf(c_0_17,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
inference(split_conjunct,[status(thm)],[ax1_254]) ).
cnf(c_0_18,plain,
mtvisible(c_tptp_spindleheadmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
fof(c_0_19,plain,
! [X23,X24] :
( ~ tptptypes_6_388(X23,X24)
| tptptypes_5_387(X23,X24) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_99])])]) ).
cnf(c_0_20,plain,
( tptptypes_6_388(X2,X1)
| ~ tptptypes_7_389(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( tptptypes_7_389(X1,X2)
| ~ tptptypes_8_390(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
( tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027)
| ~ mtvisible(c_cyclistsmt) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
mtvisible(c_cyclistsmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_17]),c_0_18])]) ).
cnf(c_0_24,negated_conjecture,
~ tptptypes_5_387(X1,c_pushingwithfingers),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_25,plain,
( tptptypes_5_387(X1,X2)
| ~ tptptypes_6_388(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
( tptptypes_6_388(X1,X2)
| ~ tptptypes_8_390(X2,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).
cnf(c_0_28,negated_conjecture,
~ tptptypes_6_388(X1,c_pushingwithfingers),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR062+2 : TPTP v8.2.0. Released v3.4.0.
% 0.03/0.12 % Command : run_E %s %d SAT
% 0.10/0.34 % Computer : n027.cluster.edu
% 0.10/0.34 % Model : x86_64 x86_64
% 0.10/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.34 % Memory : 8042.1875MB
% 0.10/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.34 % CPULimit : 300
% 0.10/0.34 % WCLimit : 300
% 0.10/0.34 % DateTime : Wed Jun 19 21:56:09 EDT 2024
% 0.10/0.34 % CPUTime :
% 0.21/0.51 Running first-order model finding
% 0.21/0.51 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.qv50MTLGDL/E---3.1_14012.p
% 0.41/0.54 # Version: 3.2.0
% 0.41/0.54 # Preprocessing class: FMLMSMSLSSSNFFN.
% 0.41/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.54 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.41/0.54 # Starting new_bool_3 with 600s (2) cores
% 0.41/0.54 # Starting new_bool_1 with 600s (2) cores
% 0.41/0.54 # Starting sh5l with 300s (1) cores
% 0.41/0.54 # new_bool_3 with pid 14090 completed with status 0
% 0.41/0.54 # Result found by new_bool_3
% 0.41/0.54 # Preprocessing class: FMLMSMSLSSSNFFN.
% 0.41/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.54 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.41/0.54 # Starting new_bool_3 with 600s (2) cores
% 0.41/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.41/0.54 # Search class: FHUNF-FFSS00-SFFFFFNN
% 0.41/0.54 # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.41/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 361s (1) cores
% 0.41/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 61s (1) cores
% 0.41/0.54 # SAT001_MinMin_p005000_rr_RG with pid 14094 completed with status 0
% 0.41/0.54 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.41/0.54 # Preprocessing class: FMLMSMSLSSSNFFN.
% 0.41/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.54 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.41/0.54 # Starting new_bool_3 with 600s (2) cores
% 0.41/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.41/0.54 # Search class: FHUNF-FFSS00-SFFFFFNN
% 0.41/0.54 # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.41/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 361s (1) cores
% 0.41/0.54 # Preprocessing time : 0.004 s
% 0.41/0.54 # Presaturation interreduction done
% 0.41/0.54
% 0.41/0.54 # Proof found!
% 0.41/0.54 # SZS status Theorem
% 0.41/0.54 # SZS output start CNFRefutation
% See solution above
% 0.41/0.54 # Parsed axioms : 1132
% 0.41/0.54 # Removed by relevancy pruning/SinE : 1109
% 0.41/0.54 # Initial clauses : 24
% 0.41/0.54 # Removed in clause preprocessing : 0
% 0.41/0.54 # Initial clauses in saturation : 24
% 0.41/0.54 # Processed clauses : 61
% 0.41/0.54 # ...of these trivial : 0
% 0.41/0.54 # ...subsumed : 4
% 0.41/0.54 # ...remaining for further processing : 57
% 0.41/0.54 # Other redundant clauses eliminated : 0
% 0.41/0.54 # Clauses deleted for lack of memory : 0
% 0.41/0.54 # Backward-subsumed : 0
% 0.41/0.54 # Backward-rewritten : 3
% 0.41/0.54 # Generated clauses : 16
% 0.41/0.54 # ...of the previous two non-redundant : 15
% 0.41/0.54 # ...aggressively subsumed : 0
% 0.41/0.54 # Contextual simplify-reflections : 0
% 0.41/0.54 # Paramodulations : 16
% 0.41/0.54 # Factorizations : 0
% 0.41/0.55 # NegExts : 0
% 0.41/0.55 # Equation resolutions : 0
% 0.41/0.55 # Disequality decompositions : 0
% 0.41/0.55 # Total rewrite steps : 7
% 0.41/0.55 # ...of those cached : 2
% 0.41/0.55 # Propositional unsat checks : 0
% 0.41/0.55 # Propositional check models : 0
% 0.41/0.55 # Propositional check unsatisfiable : 0
% 0.41/0.55 # Propositional clauses : 0
% 0.41/0.55 # Propositional clauses after purity: 0
% 0.41/0.55 # Propositional unsat core size : 0
% 0.41/0.55 # Propositional preprocessing time : 0.000
% 0.41/0.55 # Propositional encoding time : 0.000
% 0.41/0.55 # Propositional solver time : 0.000
% 0.41/0.55 # Success case prop preproc time : 0.000
% 0.41/0.55 # Success case prop encoding time : 0.000
% 0.41/0.55 # Success case prop solver time : 0.000
% 0.41/0.55 # Current number of processed clauses : 30
% 0.41/0.55 # Positive orientable unit clauses : 8
% 0.41/0.55 # Positive unorientable unit clauses: 0
% 0.41/0.55 # Negative unit clauses : 2
% 0.41/0.55 # Non-unit-clauses : 20
% 0.41/0.55 # Current number of unprocessed clauses: 2
% 0.41/0.55 # ...number of literals in the above : 4
% 0.41/0.55 # Current number of archived formulas : 0
% 0.41/0.55 # Current number of archived clauses : 27
% 0.41/0.55 # Clause-clause subsumption calls (NU) : 43
% 0.41/0.55 # Rec. Clause-clause subsumption calls : 30
% 0.41/0.55 # Non-unit clause-clause subsumptions : 4
% 0.41/0.55 # Unit Clause-clause subsumption calls : 17
% 0.41/0.55 # Rewrite failures with RHS unbound : 0
% 0.41/0.55 # BW rewrite match attempts : 1
% 0.41/0.55 # BW rewrite match successes : 1
% 0.41/0.55 # Condensation attempts : 0
% 0.41/0.55 # Condensation successes : 0
% 0.41/0.55 # Termbank termtop insertions : 8612
% 0.41/0.55 # Search garbage collected termcells : 4954
% 0.41/0.55
% 0.41/0.55 # -------------------------------------------------
% 0.41/0.55 # User time : 0.008 s
% 0.41/0.55 # System time : 0.006 s
% 0.41/0.55 # Total time : 0.014 s
% 0.41/0.55 # Maximum resident set size: 4164 pages
% 0.41/0.55
% 0.41/0.55 # -------------------------------------------------
% 0.41/0.55 # User time : 0.018 s
% 0.41/0.55 # System time : 0.016 s
% 0.41/0.55 # Total time : 0.035 s
% 0.41/0.55 # Maximum resident set size: 2648 pages
% 0.41/0.55 % E---3.1 exiting
% 0.41/0.55 % E exiting
%------------------------------------------------------------------------------