TSTP Solution File: SYN081-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN081-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 20:13:43 EDT 2023
% Result : Unsatisfiable 0.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of clauses : 9 ( 3 unt; 2 nHn; 6 RR)
% Number of literals : 15 ( 0 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 0 con; 1-1 aty)
% Number of variables : 8 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_this,negated_conjecture,
( big_f(f(X1))
| ~ big_f(X1) ),
file('/export/starexec/sandbox/tmp/tmp.6W78cLBZQe/E---3.1_23526.p',prove_this) ).
cnf(clause_2,axiom,
( big_f(f(X1))
| big_f(X1) ),
file('/export/starexec/sandbox/tmp/tmp.6W78cLBZQe/E---3.1_23526.p',clause_2) ).
cnf(clause_1,axiom,
( ~ big_f(X1)
| ~ big_f(f(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.6W78cLBZQe/E---3.1_23526.p',clause_1) ).
cnf(c_0_3,negated_conjecture,
( big_f(f(X1))
| ~ big_f(X1) ),
prove_this ).
cnf(c_0_4,axiom,
( big_f(f(X1))
| big_f(X1) ),
clause_2 ).
cnf(c_0_5,axiom,
( ~ big_f(X1)
| ~ big_f(f(X1)) ),
clause_1 ).
cnf(c_0_6,negated_conjecture,
big_f(f(X1)),
inference(csr,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_7,plain,
~ big_f(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6])]) ).
cnf(c_0_8,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_6,c_0_7]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN081-1 : TPTP v8.1.2. Released v1.0.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n005.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 : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 18:03:01 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.6W78cLBZQe/E---3.1_23526.p
% 0.20/0.48 # Version: 3.1pre001
% 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 23660 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: FGHNF-FFSF11-SFFFFFNN
% 0.20/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.48 # SAT001_MinMin_p005000_rr_RG with pid 23664 completed with status 0
% 0.20/0.48 # Result found by SAT001_MinMin_p005000_rr_RG
% 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: FGHNF-FFSF11-SFFFFFNN
% 0.20/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.48 # Preprocessing time : 0.001 s
% 0.20/0.48 # Presaturation interreduction done
% 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 : 3
% 0.20/0.48 # Removed by relevancy pruning/SinE : 0
% 0.20/0.48 # Initial clauses : 3
% 0.20/0.48 # Removed in clause preprocessing : 0
% 0.20/0.48 # Initial clauses in saturation : 3
% 0.20/0.48 # Processed clauses : 4
% 0.20/0.48 # ...of these trivial : 0
% 0.20/0.48 # ...subsumed : 0
% 0.20/0.48 # ...remaining for further processing : 4
% 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 : 1
% 0.20/0.48 # Backward-rewritten : 1
% 0.20/0.48 # Generated clauses : 1
% 0.20/0.48 # ...of the previous two non-redundant : 1
% 0.20/0.48 # ...aggressively subsumed : 0
% 0.20/0.48 # Contextual simplify-reflections : 1
% 0.20/0.48 # Paramodulations : 0
% 0.20/0.48 # Factorizations : 0
% 0.20/0.48 # NegExts : 0
% 0.20/0.48 # Equation resolutions : 0
% 0.20/0.48 # Total rewrite steps : 1
% 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 : 1
% 0.20/0.48 # Positive orientable unit clauses : 0
% 0.20/0.48 # Positive unorientable unit clauses: 0
% 0.20/0.48 # Negative unit clauses : 1
% 0.20/0.48 # Non-unit-clauses : 0
% 0.20/0.48 # Current number of unprocessed clauses: 0
% 0.20/0.48 # ...number of literals in the above : 0
% 0.20/0.48 # Current number of archived formulas : 0
% 0.20/0.48 # Current number of archived clauses : 3
% 0.20/0.48 # Clause-clause subsumption calls (NU) : 1
% 0.20/0.48 # Rec. Clause-clause subsumption calls : 1
% 0.20/0.48 # Non-unit clause-clause subsumptions : 1
% 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 : 1
% 0.20/0.48 # BW rewrite match successes : 1
% 0.20/0.48 # Condensation attempts : 0
% 0.20/0.48 # Condensation successes : 0
% 0.20/0.48 # Termbank termtop insertions : 62
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.002 s
% 0.20/0.48 # System time : 0.000 s
% 0.20/0.48 # Total time : 0.002 s
% 0.20/0.48 # Maximum resident set size: 1620 pages
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.003 s
% 0.20/0.48 # System time : 0.003 s
% 0.20/0.48 # Total time : 0.005 s
% 0.20/0.48 # Maximum resident set size: 1668 pages
% 0.20/0.48 % E---3.1 exiting
% 0.20/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------