TSTP Solution File: COL058-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : COL058-1 : TPTP v8.2.0. Released v1.0.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:03:02 EDT 2024
% Result : Unsatisfiable 0.25s 0.56s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of clauses : 10 ( 10 unt; 0 nHn; 6 RR)
% Number of literals : 10 ( 9 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 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 : 13 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_the_bird_exists,negated_conjecture,
response(X1,X1) != X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_the_bird_exists) ).
cnf(lark_exists,axiom,
response(response(lark,X1),X2) = response(X1,response(X2,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lark_exists) ).
cnf(c_0_2,negated_conjecture,
response(X1,X1) != X1,
inference(fof_simplification,[status(thm)],[prove_the_bird_exists]) ).
cnf(c_0_3,axiom,
response(response(lark,X1),X2) = response(X1,response(X2,X2)),
lark_exists ).
cnf(c_0_4,negated_conjecture,
response(X1,X1) != X1,
c_0_2 ).
cnf(c_0_5,plain,
response(X1,response(response(lark,response(X2,X2)),X2)) = response(response(lark,X1),response(X2,X2)),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_6,negated_conjecture,
response(response(response(lark,lark),response(X1,X1)),response(X1,X1)) != response(response(lark,response(X1,X1)),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_5]) ).
cnf(c_0_7,negated_conjecture,
response(response(response(lark,response(lark,lark)),X1),response(X1,X1)) != response(response(lark,response(X1,X1)),X1),
inference(spm,[status(thm)],[c_0_6,c_0_3]) ).
cnf(c_0_8,plain,
response(response(response(lark,lark),X1),X2) = response(response(X1,X1),response(X2,X2)),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_9,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_3]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : COL058-1 : TPTP v8.2.0. Released v1.0.0.
% 0.13/0.16 % Command : run_E %s %d THM
% 0.17/0.38 % Computer : n023.cluster.edu
% 0.17/0.38 % Model : x86_64 x86_64
% 0.17/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.38 % Memory : 8042.1875MB
% 0.17/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.38 % CPULimit : 300
% 0.17/0.38 % WCLimit : 300
% 0.17/0.38 % DateTime : Sat May 18 13:19:08 EDT 2024
% 0.17/0.38 % CPUTime :
% 0.25/0.53 Running first-order model finding
% 0.25/0.53 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/benchmark/theBenchmark.p
% 0.25/0.56 # Version: 3.1.0
% 0.25/0.56 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.25/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.56 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.25/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.25/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.25/0.56 # Starting sh5l with 300s (1) cores
% 0.25/0.56 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 4580 completed with status 0
% 0.25/0.56 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.25/0.56 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.25/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.56 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.25/0.56 # No SInE strategy applied
% 0.25/0.56 # Search class: FUUPF-FFSF22-SFFFFFNN
% 0.25/0.56 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.56 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.25/0.56 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.25/0.56 # Starting new_bool_3 with 136s (1) cores
% 0.25/0.56 # Starting new_bool_1 with 136s (1) cores
% 0.25/0.56 # Starting sh5l with 136s (1) cores
% 0.25/0.56 # SAT001_MinMin_p005000_rr_RG with pid 4584 completed with status 0
% 0.25/0.56 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.25/0.56 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.25/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.56 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.25/0.56 # No SInE strategy applied
% 0.25/0.56 # Search class: FUUPF-FFSF22-SFFFFFNN
% 0.25/0.56 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.56 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.25/0.56 # Preprocessing time : 0.001 s
% 0.25/0.56 # Presaturation interreduction done
% 0.25/0.56
% 0.25/0.56 # Proof found!
% 0.25/0.56 # SZS status Unsatisfiable
% 0.25/0.56 # SZS output start CNFRefutation
% See solution above
% 0.25/0.56 # Parsed axioms : 2
% 0.25/0.56 # Removed by relevancy pruning/SinE : 0
% 0.25/0.56 # Initial clauses : 2
% 0.25/0.56 # Removed in clause preprocessing : 0
% 0.25/0.56 # Initial clauses in saturation : 2
% 0.25/0.56 # Processed clauses : 16
% 0.25/0.56 # ...of these trivial : 0
% 0.25/0.56 # ...subsumed : 5
% 0.25/0.56 # ...remaining for further processing : 11
% 0.25/0.56 # Other redundant clauses eliminated : 0
% 0.25/0.56 # Clauses deleted for lack of memory : 0
% 0.25/0.56 # Backward-subsumed : 0
% 0.25/0.56 # Backward-rewritten : 0
% 0.25/0.56 # Generated clauses : 56
% 0.25/0.56 # ...of the previous two non-redundant : 55
% 0.25/0.56 # ...aggressively subsumed : 0
% 0.25/0.56 # Contextual simplify-reflections : 0
% 0.25/0.56 # Paramodulations : 56
% 0.25/0.56 # Factorizations : 0
% 0.25/0.56 # NegExts : 0
% 0.25/0.56 # Equation resolutions : 0
% 0.25/0.56 # Disequality decompositions : 0
% 0.25/0.56 # Total rewrite steps : 55
% 0.25/0.56 # ...of those cached : 43
% 0.25/0.56 # Propositional unsat checks : 0
% 0.25/0.56 # Propositional check models : 0
% 0.25/0.56 # Propositional check unsatisfiable : 0
% 0.25/0.56 # Propositional clauses : 0
% 0.25/0.56 # Propositional clauses after purity: 0
% 0.25/0.56 # Propositional unsat core size : 0
% 0.25/0.56 # Propositional preprocessing time : 0.000
% 0.25/0.56 # Propositional encoding time : 0.000
% 0.25/0.56 # Propositional solver time : 0.000
% 0.25/0.56 # Success case prop preproc time : 0.000
% 0.25/0.56 # Success case prop encoding time : 0.000
% 0.25/0.56 # Success case prop solver time : 0.000
% 0.25/0.56 # Current number of processed clauses : 9
% 0.25/0.56 # Positive orientable unit clauses : 1
% 0.25/0.56 # Positive unorientable unit clauses: 2
% 0.25/0.56 # Negative unit clauses : 6
% 0.25/0.56 # Non-unit-clauses : 0
% 0.25/0.56 # Current number of unprocessed clauses: 36
% 0.25/0.56 # ...number of literals in the above : 36
% 0.25/0.56 # Current number of archived formulas : 0
% 0.25/0.56 # Current number of archived clauses : 2
% 0.25/0.56 # Clause-clause subsumption calls (NU) : 0
% 0.25/0.56 # Rec. Clause-clause subsumption calls : 0
% 0.25/0.56 # Non-unit clause-clause subsumptions : 0
% 0.25/0.56 # Unit Clause-clause subsumption calls : 2
% 0.25/0.56 # Rewrite failures with RHS unbound : 0
% 0.25/0.56 # BW rewrite match attempts : 0
% 0.25/0.56 # BW rewrite match successes : 0
% 0.25/0.56 # Condensation attempts : 0
% 0.25/0.56 # Condensation successes : 0
% 0.25/0.56 # Termbank termtop insertions : 1039
% 0.25/0.56 # Search garbage collected termcells : 2
% 0.25/0.56
% 0.25/0.56 # -------------------------------------------------
% 0.25/0.56 # User time : 0.003 s
% 0.25/0.56 # System time : 0.002 s
% 0.25/0.56 # Total time : 0.005 s
% 0.25/0.56 # Maximum resident set size: 1544 pages
% 0.25/0.56
% 0.25/0.56 # -------------------------------------------------
% 0.25/0.56 # User time : 0.014 s
% 0.25/0.56 # System time : 0.007 s
% 0.25/0.56 # Total time : 0.020 s
% 0.25/0.56 # Maximum resident set size: 1680 pages
% 0.25/0.56 % E---3.1 exiting
%------------------------------------------------------------------------------