TSTP Solution File: COL058-3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : COL058-3 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:02:19 EDT 2024
% Result : Unsatisfiable 0.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of clauses : 8 ( 8 unt; 0 nHn; 4 RR)
% Number of literals : 8 ( 7 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(lark_exists,axiom,
response(response(lark,X1),X2) = response(X1,response(X2,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lark_exists) ).
cnf(prove_the_bird_exists,negated_conjecture,
response(response(response(response(lark,lark),response(lark,response(lark,lark))),response(lark,response(lark,lark))),response(response(response(lark,lark),response(lark,response(lark,lark))),response(lark,response(lark,lark)))) != response(response(response(lark,lark),response(lark,response(lark,lark))),response(lark,response(lark,lark))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_the_bird_exists) ).
cnf(c_0_2,axiom,
response(response(lark,X1),X2) = response(X1,response(X2,X2)),
lark_exists ).
cnf(c_0_3,negated_conjecture,
response(response(response(response(lark,lark),response(lark,response(lark,lark))),response(lark,response(lark,lark))),response(response(response(lark,lark),response(lark,response(lark,lark))),response(lark,response(lark,lark)))) != response(response(response(lark,lark),response(lark,response(lark,lark))),response(lark,response(lark,lark))),
inference(fof_simplification,[status(thm)],[prove_the_bird_exists]) ).
cnf(c_0_4,plain,
response(X1,response(response(lark,response(X2,X2)),X2)) = response(response(lark,X1),response(X2,X2)),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_5,negated_conjecture,
response(response(response(response(lark,lark),response(lark,response(lark,lark))),response(lark,response(lark,lark))),response(response(response(lark,lark),response(lark,response(lark,lark))),response(lark,response(lark,lark)))) != response(response(response(lark,lark),response(lark,response(lark,lark))),response(lark,response(lark,lark))),
c_0_3 ).
cnf(c_0_6,plain,
response(X1,response(response(response(lark,lark),X2),X2)) = response(response(lark,X1),response(X2,X2)),
inference(spm,[status(thm)],[c_0_4,c_0_2]) ).
cnf(c_0_7,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6]),c_0_6]),c_0_2]),c_0_2]),c_0_2])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : COL058-3 : TPTP v8.2.0. Released v1.0.0.
% 0.04/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n009.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sat May 18 13:22:38 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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.20/0.48 # Version: 3.1.0
% 0.20/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48 # Starting sh5l with 300s (1) cores
% 0.20/0.48 # new_bool_3 with pid 5728 completed with status 0
% 0.20/0.48 # Result found by new_bool_3
% 0.20/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.48 # Search class: FUUPF-FFSF22-MFFFFFNN
% 0.20/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting G-E--_209_C18_F1_AE_CS_SP_PI_S0Y with 93s (1) cores
% 0.20/0.48 # G-E--_209_C18_F1_AE_CS_SP_PI_S0Y with pid 5733 completed with status 0
% 0.20/0.48 # Result found by G-E--_209_C18_F1_AE_CS_SP_PI_S0Y
% 0.20/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.48 # Search class: FUUPF-FFSF22-MFFFFFNN
% 0.20/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting G-E--_209_C18_F1_AE_CS_SP_PI_S0Y with 93s (1) cores
% 0.20/0.48 # Preprocessing time : 0.001 s
% 0.20/0.48
% 0.20/0.48 # Proof found!
% 0.20/0.48 # SZS status Unsatisfiable
% 0.20/0.48 # SZS output start CNFRefutation
% See solution above
% 0.20/0.48 # Parsed axioms : 2
% 0.20/0.48 # Removed by relevancy pruning/SinE : 0
% 0.20/0.48 # Initial clauses : 2
% 0.20/0.48 # Removed in clause preprocessing : 0
% 0.20/0.48 # Initial clauses in saturation : 2
% 0.20/0.48 # Processed clauses : 7
% 0.20/0.48 # ...of these trivial : 1
% 0.20/0.48 # ...subsumed : 1
% 0.20/0.48 # ...remaining for further processing : 5
% 0.20/0.48 # Other redundant clauses eliminated : 0
% 0.20/0.48 # Clauses deleted for lack of memory : 0
% 0.20/0.48 # Backward-subsumed : 0
% 0.20/0.48 # Backward-rewritten : 1
% 0.20/0.48 # Generated clauses : 36
% 0.20/0.48 # ...of the previous two non-redundant : 20
% 0.20/0.48 # ...aggressively subsumed : 0
% 0.20/0.48 # Contextual simplify-reflections : 0
% 0.20/0.48 # Paramodulations : 36
% 0.20/0.48 # Factorizations : 0
% 0.20/0.48 # NegExts : 0
% 0.20/0.48 # Equation resolutions : 0
% 0.20/0.48 # Disequality decompositions : 0
% 0.20/0.48 # Total rewrite steps : 22
% 0.20/0.48 # ...of those cached : 8
% 0.20/0.48 # Propositional unsat checks : 0
% 0.20/0.48 # Propositional check models : 0
% 0.20/0.48 # Propositional check unsatisfiable : 0
% 0.20/0.48 # Propositional clauses : 0
% 0.20/0.48 # Propositional clauses after purity: 0
% 0.20/0.48 # Propositional unsat core size : 0
% 0.20/0.48 # Propositional preprocessing time : 0.000
% 0.20/0.48 # Propositional encoding time : 0.000
% 0.20/0.48 # Propositional solver time : 0.000
% 0.20/0.48 # Success case prop preproc time : 0.000
% 0.20/0.48 # Success case prop encoding time : 0.000
% 0.20/0.48 # Success case prop solver time : 0.000
% 0.20/0.48 # Current number of processed clauses : 4
% 0.20/0.48 # Positive orientable unit clauses : 2
% 0.20/0.48 # Positive unorientable unit clauses: 2
% 0.20/0.48 # Negative unit clauses : 0
% 0.20/0.48 # Non-unit-clauses : 0
% 0.20/0.48 # Current number of unprocessed clauses: 15
% 0.20/0.48 # ...number of literals in the above : 15
% 0.20/0.48 # Current number of archived formulas : 0
% 0.20/0.48 # Current number of archived clauses : 1
% 0.20/0.48 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.48 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.48 # Non-unit clause-clause subsumptions : 0
% 0.20/0.48 # Unit Clause-clause subsumption calls : 1
% 0.20/0.48 # Rewrite failures with RHS unbound : 0
% 0.20/0.48 # BW rewrite match attempts : 9
% 0.20/0.48 # BW rewrite match successes : 2
% 0.20/0.48 # Condensation attempts : 0
% 0.20/0.48 # Condensation successes : 0
% 0.20/0.48 # Termbank termtop insertions : 845
% 0.20/0.48 # Search garbage collected termcells : 2
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.004 s
% 0.20/0.48 # System time : 0.000 s
% 0.20/0.48 # Total time : 0.004 s
% 0.20/0.48 # Maximum resident set size: 1616 pages
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.004 s
% 0.20/0.48 # System time : 0.003 s
% 0.20/0.48 # Total time : 0.007 s
% 0.20/0.48 # Maximum resident set size: 1676 pages
% 0.20/0.48 % E---3.1 exiting
% 0.20/0.48 % E exiting
%------------------------------------------------------------------------------