TSTP Solution File: CSR062+3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CSR062+3 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:35:37 EDT 2024
% Result : Theorem 1.02s 1.35s
% Output : CNFRefutation 1.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 30 ( 12 unt; 0 def)
% Number of atoms : 51 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 37 ( 16 ~; 12 |; 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(query162,conjecture,
? [X3] :
( mtvisible(c_tptp_member3205_mt)
=> tptptypes_5_387(X3,c_pushingwithfingers) ),
file('/export/starexec/sandbox/tmp/tmp.tVWVGRzagH/E---3.1_19221.p',query162) ).
fof(ax2_7997,axiom,
! [X21,X22] :
( ( mtvisible(X21)
& genlmt(X21,X22) )
=> mtvisible(X22) ),
file('/export/starexec/sandbox/tmp/tmp.tVWVGRzagH/E---3.1_19221.p',ax2_7997) ).
fof(ax2_2187,axiom,
genlmt(c_tptp_member3205_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox/tmp/tmp.tVWVGRzagH/E---3.1_19221.p',ax2_2187) ).
fof(ax2_968,axiom,
( mtvisible(c_cyclistsmt)
=> tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027) ),
file('/export/starexec/sandbox/tmp/tmp.tVWVGRzagH/E---3.1_19221.p',ax2_968) ).
fof(ax2_4288,axiom,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox/tmp/tmp.tVWVGRzagH/E---3.1_19221.p',ax2_4288) ).
fof(ax2_2531,axiom,
! [X3,X4] :
( tptptypes_8_390(X3,X4)
=> tptptypes_7_389(X3,X4) ),
file('/export/starexec/sandbox/tmp/tmp.tVWVGRzagH/E---3.1_19221.p',ax2_2531) ).
fof(ax2_1143,axiom,
! [X3,X4] :
( tptptypes_6_388(X3,X4)
=> tptptypes_5_387(X3,X4) ),
file('/export/starexec/sandbox/tmp/tmp.tVWVGRzagH/E---3.1_19221.p',ax2_1143) ).
fof(ax2_1462,axiom,
! [X3,X4] :
( tptptypes_7_389(X3,X4)
=> tptptypes_6_388(X4,X3) ),
file('/export/starexec/sandbox/tmp/tmp.tVWVGRzagH/E---3.1_19221.p',ax2_1462) ).
fof(c_0_8,negated_conjecture,
~ ? [X3] :
( mtvisible(c_tptp_member3205_mt)
=> tptptypes_5_387(X3,c_pushingwithfingers) ),
inference(assume_negation,[status(cth)],[query162]) ).
fof(c_0_9,plain,
! [X32,X33] :
( ~ mtvisible(X32)
| ~ genlmt(X32,X33)
| mtvisible(X33) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_7997])])]) ).
fof(c_0_10,negated_conjecture,
! [X23] :
( mtvisible(c_tptp_member3205_mt)
& ~ tptptypes_5_387(X23,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)],[ax2_2187]) ).
cnf(c_0_13,negated_conjecture,
mtvisible(c_tptp_member3205_mt),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
( ~ mtvisible(c_cyclistsmt)
| tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_968])]) ).
cnf(c_0_15,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
inference(split_conjunct,[status(thm)],[ax2_4288]) ).
cnf(c_0_16,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_17,plain,
! [X46,X47] :
( ~ tptptypes_8_390(X46,X47)
| tptptypes_7_389(X46,X47) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_2531])])]) ).
cnf(c_0_18,plain,
( tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027)
| ~ mtvisible(c_cyclistsmt) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
mtvisible(c_cyclistsmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_15]),c_0_16])]) ).
fof(c_0_20,plain,
! [X24,X25] :
( ~ tptptypes_6_388(X24,X25)
| tptptypes_5_387(X24,X25) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_1143])])]) ).
fof(c_0_21,plain,
! [X34,X35] :
( ~ tptptypes_7_389(X34,X35)
| tptptypes_6_388(X35,X34) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_1462])])]) ).
cnf(c_0_22,plain,
( tptptypes_7_389(X1,X2)
| ~ tptptypes_8_390(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).
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_20]) ).
cnf(c_0_26,plain,
( tptptypes_6_388(X2,X1)
| ~ tptptypes_7_389(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
tptptypes_7_389(c_pushingwithfingers,c_tptpcol_15_4027),
inference(spm,[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.07/0.12 % Problem : CSR062+3 : TPTP v8.1.2. Released v3.4.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n022.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 14:31:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 1.02/1.18 Running first-order model finding
% 1.02/1.18 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.tVWVGRzagH/E---3.1_19221.p
% 1.02/1.35 # Version: 3.1.0
% 1.02/1.35 # Preprocessing class: FMLLMMSLSSSNFFN.
% 1.02/1.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.02/1.35 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 1.02/1.35 # Starting new_bool_3 with 300s (1) cores
% 1.02/1.35 # Starting new_bool_1 with 300s (1) cores
% 1.02/1.35 # Starting sh5l with 300s (1) cores
% 1.02/1.35 # new_bool_3 with pid 19299 completed with status 0
% 1.02/1.35 # Result found by new_bool_3
% 1.02/1.35 # Preprocessing class: FMLLMMSLSSSNFFN.
% 1.02/1.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.02/1.35 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 1.02/1.35 # Starting new_bool_3 with 300s (1) cores
% 1.02/1.35 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.02/1.35 # Search class: FHUNF-FFSM00-SFFFFFNN
% 1.02/1.35 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.02/1.35 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.02/1.35 # SAT001_MinMin_p005000_rr_RG with pid 19303 completed with status 0
% 1.02/1.35 # Result found by SAT001_MinMin_p005000_rr_RG
% 1.02/1.35 # Preprocessing class: FMLLMMSLSSSNFFN.
% 1.02/1.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.02/1.35 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 1.02/1.35 # Starting new_bool_3 with 300s (1) cores
% 1.02/1.35 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.02/1.35 # Search class: FHUNF-FFSM00-SFFFFFNN
% 1.02/1.35 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.02/1.35 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.02/1.35 # Preprocessing time : 0.008 s
% 1.02/1.35 # Presaturation interreduction done
% 1.02/1.35
% 1.02/1.35 # Proof found!
% 1.02/1.35 # SZS status Theorem
% 1.02/1.35 # SZS output start CNFRefutation
% See solution above
% 1.02/1.35 # Parsed axioms : 8006
% 1.02/1.35 # Removed by relevancy pruning/SinE : 7972
% 1.02/1.35 # Initial clauses : 35
% 1.02/1.35 # Removed in clause preprocessing : 0
% 1.02/1.35 # Initial clauses in saturation : 35
% 1.02/1.35 # Processed clauses : 73
% 1.02/1.35 # ...of these trivial : 2
% 1.02/1.35 # ...subsumed : 8
% 1.02/1.35 # ...remaining for further processing : 63
% 1.02/1.35 # Other redundant clauses eliminated : 0
% 1.02/1.35 # Clauses deleted for lack of memory : 0
% 1.02/1.35 # Backward-subsumed : 0
% 1.02/1.35 # Backward-rewritten : 3
% 1.02/1.35 # Generated clauses : 24
% 1.02/1.35 # ...of the previous two non-redundant : 18
% 1.02/1.35 # ...aggressively subsumed : 0
% 1.02/1.35 # Contextual simplify-reflections : 0
% 1.02/1.35 # Paramodulations : 24
% 1.02/1.35 # Factorizations : 0
% 1.02/1.35 # NegExts : 0
% 1.02/1.35 # Equation resolutions : 0
% 1.02/1.35 # Disequality decompositions : 0
% 1.02/1.35 # Total rewrite steps : 15
% 1.02/1.35 # ...of those cached : 7
% 1.02/1.35 # Propositional unsat checks : 0
% 1.02/1.35 # Propositional check models : 0
% 1.02/1.35 # Propositional check unsatisfiable : 0
% 1.02/1.35 # Propositional clauses : 0
% 1.02/1.35 # Propositional clauses after purity: 0
% 1.02/1.35 # Propositional unsat core size : 0
% 1.02/1.35 # Propositional preprocessing time : 0.000
% 1.02/1.35 # Propositional encoding time : 0.000
% 1.02/1.35 # Propositional solver time : 0.000
% 1.02/1.35 # Success case prop preproc time : 0.000
% 1.02/1.35 # Success case prop encoding time : 0.000
% 1.02/1.35 # Success case prop solver time : 0.000
% 1.02/1.35 # Current number of processed clauses : 33
% 1.02/1.35 # Positive orientable unit clauses : 14
% 1.02/1.35 # Positive unorientable unit clauses: 0
% 1.02/1.35 # Negative unit clauses : 2
% 1.02/1.35 # Non-unit-clauses : 17
% 1.02/1.35 # Current number of unprocessed clauses: 7
% 1.02/1.35 # ...number of literals in the above : 14
% 1.02/1.35 # Current number of archived formulas : 0
% 1.02/1.35 # Current number of archived clauses : 30
% 1.02/1.35 # Clause-clause subsumption calls (NU) : 53
% 1.02/1.35 # Rec. Clause-clause subsumption calls : 47
% 1.02/1.35 # Non-unit clause-clause subsumptions : 8
% 1.02/1.35 # Unit Clause-clause subsumption calls : 3
% 1.02/1.35 # Rewrite failures with RHS unbound : 0
% 1.02/1.35 # BW rewrite match attempts : 1
% 1.02/1.35 # BW rewrite match successes : 1
% 1.02/1.35 # Condensation attempts : 0
% 1.02/1.35 # Condensation successes : 0
% 1.02/1.35 # Termbank termtop insertions : 52552
% 1.02/1.35 # Search garbage collected termcells : 31148
% 1.02/1.35
% 1.02/1.35 # -------------------------------------------------
% 1.02/1.35 # User time : 0.030 s
% 1.02/1.35 # System time : 0.024 s
% 1.02/1.35 # Total time : 0.054 s
% 1.02/1.35 # Maximum resident set size: 18172 pages
% 1.02/1.35
% 1.02/1.35 # -------------------------------------------------
% 1.02/1.35 # User time : 0.129 s
% 1.02/1.35 # System time : 0.032 s
% 1.02/1.35 # Total time : 0.161 s
% 1.02/1.35 # Maximum resident set size: 8064 pages
% 1.02/1.35 % E---3.1 exiting
%------------------------------------------------------------------------------