TSTP Solution File: CSR055+3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CSR055+3 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:31 EDT 2024
% Result : Theorem 0.99s 1.32s
% Output : CNFRefutation 0.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 13 ( 7 unt; 0 def)
% Number of atoms : 19 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 15 ( 9 ~; 4 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 9 ( 1 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax2_3089,axiom,
! [X1] :
~ ( collection(X1)
& individual(X1) ),
file('/export/starexec/sandbox/tmp/tmp.zsOUEvYzEB/E---3.1_21389.p',ax2_3089) ).
fof(ax2_7583,axiom,
! [X2,X4] :
( disjointwith(X2,X4)
=> collection(X2) ),
file('/export/starexec/sandbox/tmp/tmp.zsOUEvYzEB/E---3.1_21389.p',ax2_7583) ).
fof(query155,conjecture,
~ disjointwith(c_xskijump_thegame,c_tptpcol_16_35301),
file('/export/starexec/sandbox/tmp/tmp.zsOUEvYzEB/E---3.1_21389.p',query155) ).
fof(ax2_185,axiom,
individual(c_xskijump_thegame),
file('/export/starexec/sandbox/tmp/tmp.zsOUEvYzEB/E---3.1_21389.p',ax2_185) ).
fof(c_0_4,plain,
! [X53] :
( ~ collection(X53)
| ~ individual(X53) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_3089])])]) ).
fof(c_0_5,plain,
! [X35,X36] :
( ~ disjointwith(X35,X36)
| collection(X35) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_7583])])]) ).
fof(c_0_6,negated_conjecture,
disjointwith(c_xskijump_thegame,c_tptpcol_16_35301),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[query155])]) ).
cnf(c_0_7,plain,
( ~ collection(X1)
| ~ individual(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
individual(c_xskijump_thegame),
inference(split_conjunct,[status(thm)],[ax2_185]) ).
cnf(c_0_9,plain,
( collection(X1)
| ~ disjointwith(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
disjointwith(c_xskijump_thegame,c_tptpcol_16_35301),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
~ collection(c_xskijump_thegame),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR055+3 : TPTP v8.1.2. Released v3.4.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n021.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 15:05:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.91/1.15 Running first-order model finding
% 0.91/1.15 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.zsOUEvYzEB/E---3.1_21389.p
% 0.99/1.32 # Version: 3.1.0
% 0.99/1.32 # Preprocessing class: FMLLMMSLSSSNFFN.
% 0.99/1.32 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.99/1.32 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 0.99/1.32 # Starting new_bool_3 with 300s (1) cores
% 0.99/1.32 # Starting new_bool_1 with 300s (1) cores
% 0.99/1.32 # Starting sh5l with 300s (1) cores
% 0.99/1.32 # new_bool_1 with pid 21470 completed with status 0
% 0.99/1.32 # Result found by new_bool_1
% 0.99/1.32 # Preprocessing class: FMLLMMSLSSSNFFN.
% 0.99/1.32 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.99/1.32 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 0.99/1.32 # Starting new_bool_3 with 300s (1) cores
% 0.99/1.32 # Starting new_bool_1 with 300s (1) cores
% 0.99/1.32 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.99/1.32 # Search class: FHHNM-FFMM33-SFFFFFNN
% 0.99/1.32 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.99/1.32 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.99/1.32 # SAT001_MinMin_p005000_rr_RG with pid 21472 completed with status 0
% 0.99/1.32 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.99/1.32 # Preprocessing class: FMLLMMSLSSSNFFN.
% 0.99/1.32 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.99/1.32 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 0.99/1.32 # Starting new_bool_3 with 300s (1) cores
% 0.99/1.32 # Starting new_bool_1 with 300s (1) cores
% 0.99/1.32 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.99/1.32 # Search class: FHHNM-FFMM33-SFFFFFNN
% 0.99/1.32 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.99/1.32 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.99/1.32 # Preprocessing time : 0.008 s
% 0.99/1.32 # Presaturation interreduction done
% 0.99/1.32
% 0.99/1.32 # Proof found!
% 0.99/1.32 # SZS status Theorem
% 0.99/1.32 # SZS output start CNFRefutation
% See solution above
% 0.99/1.32 # Parsed axioms : 8006
% 0.99/1.32 # Removed by relevancy pruning/SinE : 7947
% 0.99/1.32 # Initial clauses : 59
% 0.99/1.32 # Removed in clause preprocessing : 0
% 0.99/1.32 # Initial clauses in saturation : 59
% 0.99/1.32 # Processed clauses : 75
% 0.99/1.32 # ...of these trivial : 5
% 0.99/1.32 # ...subsumed : 15
% 0.99/1.32 # ...remaining for further processing : 55
% 0.99/1.32 # Other redundant clauses eliminated : 0
% 0.99/1.32 # Clauses deleted for lack of memory : 0
% 0.99/1.32 # Backward-subsumed : 0
% 0.99/1.32 # Backward-rewritten : 0
% 0.99/1.32 # Generated clauses : 7
% 0.99/1.32 # ...of the previous two non-redundant : 4
% 0.99/1.32 # ...aggressively subsumed : 0
% 0.99/1.32 # Contextual simplify-reflections : 0
% 0.99/1.32 # Paramodulations : 7
% 0.99/1.32 # Factorizations : 0
% 0.99/1.32 # NegExts : 0
% 0.99/1.32 # Equation resolutions : 0
% 0.99/1.32 # Disequality decompositions : 0
% 0.99/1.32 # Total rewrite steps : 5
% 0.99/1.32 # ...of those cached : 0
% 0.99/1.32 # Propositional unsat checks : 0
% 0.99/1.32 # Propositional check models : 0
% 0.99/1.32 # Propositional check unsatisfiable : 0
% 0.99/1.32 # Propositional clauses : 0
% 0.99/1.32 # Propositional clauses after purity: 0
% 0.99/1.32 # Propositional unsat core size : 0
% 0.99/1.32 # Propositional preprocessing time : 0.000
% 0.99/1.32 # Propositional encoding time : 0.000
% 0.99/1.32 # Propositional solver time : 0.000
% 0.99/1.32 # Success case prop preproc time : 0.000
% 0.99/1.32 # Success case prop encoding time : 0.000
% 0.99/1.32 # Success case prop solver time : 0.000
% 0.99/1.32 # Current number of processed clauses : 16
% 0.99/1.32 # Positive orientable unit clauses : 8
% 0.99/1.32 # Positive unorientable unit clauses: 0
% 0.99/1.32 # Negative unit clauses : 1
% 0.99/1.32 # Non-unit-clauses : 7
% 0.99/1.32 # Current number of unprocessed clauses: 27
% 0.99/1.32 # ...number of literals in the above : 53
% 0.99/1.32 # Current number of archived formulas : 0
% 0.99/1.32 # Current number of archived clauses : 39
% 0.99/1.32 # Clause-clause subsumption calls (NU) : 38
% 0.99/1.32 # Rec. Clause-clause subsumption calls : 37
% 0.99/1.32 # Non-unit clause-clause subsumptions : 15
% 0.99/1.32 # Unit Clause-clause subsumption calls : 9
% 0.99/1.32 # Rewrite failures with RHS unbound : 0
% 0.99/1.32 # BW rewrite match attempts : 0
% 0.99/1.32 # BW rewrite match successes : 0
% 0.99/1.32 # Condensation attempts : 0
% 0.99/1.32 # Condensation successes : 0
% 0.99/1.32 # Termbank termtop insertions : 53563
% 0.99/1.32 # Search garbage collected termcells : 31226
% 0.99/1.32
% 0.99/1.32 # -------------------------------------------------
% 0.99/1.32 # User time : 0.019 s
% 0.99/1.32 # System time : 0.022 s
% 0.99/1.32 # Total time : 0.041 s
% 0.99/1.32 # Maximum resident set size: 18196 pages
% 0.99/1.32
% 0.99/1.32 # -------------------------------------------------
% 0.99/1.32 # User time : 0.128 s
% 0.99/1.32 # System time : 0.033 s
% 0.99/1.32 # Total time : 0.161 s
% 0.99/1.32 # Maximum resident set size: 8064 pages
% 0.99/1.32 % E---3.1 exiting
%------------------------------------------------------------------------------