TSTP Solution File: CSR062+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR062+1 : TPTP v8.2.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:53 EDT 2024
% Result : Theorem 0.16s 0.46s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% 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 : 40 ( 18 ~; 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(query62,conjecture,
? [X1] :
( mtvisible(c_tptp_member3205_mt)
=> tptptypes_5_387(X1,c_pushingwithfingers) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query62) ).
fof(just11,axiom,
! [X1,X2] :
( tptptypes_8_390(X1,X2)
=> tptptypes_7_389(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just11) ).
fof(just14,axiom,
( mtvisible(c_cyclistsmt)
=> tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just14) ).
fof(just7,axiom,
! [X1,X2] :
( tptptypes_6_388(X1,X2)
=> tptptypes_5_387(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just7) ).
fof(just9,axiom,
! [X1,X2] :
( tptptypes_7_389(X1,X2)
=> tptptypes_6_388(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just9) ).
fof(just53,axiom,
! [X15,X16] :
( ( mtvisible(X15)
& genlmt(X15,X16) )
=> mtvisible(X16) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just53) ).
fof(just13,axiom,
genlmt(c_tptp_member3205_mt,c_tptp_spindleheadmt),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just13) ).
fof(just12,axiom,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just12) ).
fof(c_0_8,negated_conjecture,
~ ? [X1] :
( mtvisible(c_tptp_member3205_mt)
=> tptptypes_5_387(X1,c_pushingwithfingers) ),
inference(assume_negation,[status(cth)],[query62]) ).
fof(c_0_9,plain,
! [X32,X33] :
( ~ tptptypes_8_390(X32,X33)
| tptptypes_7_389(X32,X33) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just11])])]) ).
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)],[just14])]) ).
fof(c_0_11,negated_conjecture,
! [X17] :
( mtvisible(c_tptp_member3205_mt)
& ~ tptptypes_5_387(X17,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,
! [X18,X19] :
( ~ tptptypes_6_388(X18,X19)
| tptptypes_5_387(X18,X19) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just7])])]) ).
fof(c_0_13,plain,
! [X26,X27] :
( ~ tptptypes_7_389(X26,X27)
| tptptypes_6_388(X27,X26) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just9])])]) ).
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,
! [X24,X25] :
( ~ mtvisible(X24)
| ~ genlmt(X24,X25)
| mtvisible(X25) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just53])])]) ).
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_member3205_mt,c_tptp_spindleheadmt),
inference(split_conjunct,[status(thm)],[just13]) ).
cnf(c_0_24,negated_conjecture,
mtvisible(c_tptp_member3205_mt),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_25,plain,
genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
inference(split_conjunct,[status(thm)],[just12]) ).
cnf(c_0_26,plain,
~ mtvisible(c_cyclistsmt),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_27,plain,
mtvisible(c_tptp_spindleheadmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_28,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_25]),c_0_26]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09 % Problem : CSR062+1 : TPTP v8.2.0. Released v3.4.0.
% 0.04/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n023.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Sun May 19 00:23:08 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.44 Running first-order theorem proving
% 0.16/0.44 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/benchmark/theBenchmark.p
% 0.16/0.46 # Version: 3.1.0
% 0.16/0.46 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.16/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.46 # Starting sh5l with 300s (1) cores
% 0.16/0.46 # new_bool_3 with pid 10662 completed with status 0
% 0.16/0.46 # Result found by new_bool_3
% 0.16/0.46 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.16/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.46 # Search class: FHUNF-FFSS00-SFFFFFNN
% 0.16/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.46 # SAT001_MinMin_p005000_rr_RG with pid 10665 completed with status 0
% 0.16/0.46 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.46 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.16/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.46 # Search class: FHUNF-FFSS00-SFFFFFNN
% 0.16/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.46 # Preprocessing time : 0.001 s
% 0.16/0.46 # Presaturation interreduction done
% 0.16/0.46
% 0.16/0.46 # Proof found!
% 0.16/0.46 # SZS status Theorem
% 0.16/0.46 # SZS output start CNFRefutation
% See solution above
% 0.16/0.46 # Parsed axioms : 62
% 0.16/0.46 # Removed by relevancy pruning/SinE : 41
% 0.16/0.46 # Initial clauses : 22
% 0.16/0.46 # Removed in clause preprocessing : 0
% 0.16/0.46 # Initial clauses in saturation : 22
% 0.16/0.46 # Processed clauses : 52
% 0.16/0.46 # ...of these trivial : 0
% 0.16/0.46 # ...subsumed : 2
% 0.16/0.46 # ...remaining for further processing : 49
% 0.16/0.46 # Other redundant clauses eliminated : 0
% 0.16/0.46 # Clauses deleted for lack of memory : 0
% 0.16/0.46 # Backward-subsumed : 4
% 0.16/0.46 # Backward-rewritten : 0
% 0.16/0.46 # Generated clauses : 14
% 0.16/0.46 # ...of the previous two non-redundant : 13
% 0.16/0.46 # ...aggressively subsumed : 0
% 0.16/0.46 # Contextual simplify-reflections : 0
% 0.16/0.46 # Paramodulations : 14
% 0.16/0.46 # Factorizations : 0
% 0.16/0.46 # NegExts : 0
% 0.16/0.46 # Equation resolutions : 0
% 0.16/0.46 # Disequality decompositions : 0
% 0.16/0.46 # Total rewrite steps : 2
% 0.16/0.46 # ...of those cached : 0
% 0.16/0.46 # Propositional unsat checks : 0
% 0.16/0.46 # Propositional check models : 0
% 0.16/0.46 # Propositional check unsatisfiable : 0
% 0.16/0.46 # Propositional clauses : 0
% 0.16/0.46 # Propositional clauses after purity: 0
% 0.16/0.46 # Propositional unsat core size : 0
% 0.16/0.46 # Propositional preprocessing time : 0.000
% 0.16/0.46 # Propositional encoding time : 0.000
% 0.16/0.46 # Propositional solver time : 0.000
% 0.16/0.46 # Success case prop preproc time : 0.000
% 0.16/0.46 # Success case prop encoding time : 0.000
% 0.16/0.46 # Success case prop solver time : 0.000
% 0.16/0.46 # Current number of processed clauses : 23
% 0.16/0.46 # Positive orientable unit clauses : 6
% 0.16/0.46 # Positive unorientable unit clauses: 0
% 0.16/0.46 # Negative unit clauses : 3
% 0.16/0.46 # Non-unit-clauses : 14
% 0.16/0.46 # Current number of unprocessed clauses: 3
% 0.16/0.46 # ...number of literals in the above : 7
% 0.16/0.46 # Current number of archived formulas : 0
% 0.16/0.46 # Current number of archived clauses : 26
% 0.16/0.46 # Clause-clause subsumption calls (NU) : 84
% 0.16/0.46 # Rec. Clause-clause subsumption calls : 51
% 0.16/0.46 # Non-unit clause-clause subsumptions : 2
% 0.16/0.46 # Unit Clause-clause subsumption calls : 7
% 0.16/0.46 # Rewrite failures with RHS unbound : 0
% 0.16/0.46 # BW rewrite match attempts : 0
% 0.16/0.46 # BW rewrite match successes : 0
% 0.16/0.46 # Condensation attempts : 0
% 0.16/0.46 # Condensation successes : 0
% 0.16/0.46 # Termbank termtop insertions : 1575
% 0.16/0.46 # Search garbage collected termcells : 404
% 0.16/0.46
% 0.16/0.46 # -------------------------------------------------
% 0.16/0.46 # User time : 0.006 s
% 0.16/0.46 # System time : 0.001 s
% 0.16/0.46 # Total time : 0.007 s
% 0.16/0.46 # Maximum resident set size: 1876 pages
% 0.16/0.46
% 0.16/0.46 # -------------------------------------------------
% 0.16/0.46 # User time : 0.008 s
% 0.16/0.46 # System time : 0.004 s
% 0.16/0.46 # Total time : 0.012 s
% 0.16/0.46 # Maximum resident set size: 1760 pages
% 0.16/0.46 % E---3.1 exiting
% 0.16/0.46 % E exiting
%------------------------------------------------------------------------------