TSTP Solution File: SYN084-2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYN084-2 : TPTP v8.1.2. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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 10:19:17 EDT 2024
% Result : Unsatisfiable 0.21s 0.49s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of clauses : 37 ( 8 unt; 8 nHn; 33 RR)
% Number of literals : 85 ( 0 equ; 48 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(pel62_3,negated_conjecture,
( big_p(f(f(X1)))
| ~ big_p(f(X1))
| ~ big_p(a) ),
file('/export/starexec/sandbox/tmp/tmp.Kam1pqE2lE/E---3.1_9765.p',pel62_3) ).
cnf(pel62_4,negated_conjecture,
( ~ big_p(f(f(sk1)))
| ~ big_p(f(f(sk2))) ),
file('/export/starexec/sandbox/tmp/tmp.Kam1pqE2lE/E---3.1_9765.p',pel62_4) ).
cnf(pel62_1,negated_conjecture,
big_p(a),
file('/export/starexec/sandbox/tmp/tmp.Kam1pqE2lE/E---3.1_9765.p',pel62_1) ).
cnf(pel62_2,negated_conjecture,
( big_p(f(f(X1)))
| big_p(X1)
| ~ big_p(a) ),
file('/export/starexec/sandbox/tmp/tmp.Kam1pqE2lE/E---3.1_9765.p',pel62_2) ).
cnf(pel62_6,negated_conjecture,
( big_p(f(sk1))
| ~ big_p(sk1)
| ~ big_p(f(f(sk2))) ),
file('/export/starexec/sandbox/tmp/tmp.Kam1pqE2lE/E---3.1_9765.p',pel62_6) ).
cnf(pel62_7,negated_conjecture,
( big_p(f(sk2))
| ~ big_p(sk2)
| ~ big_p(f(f(sk1))) ),
file('/export/starexec/sandbox/tmp/tmp.Kam1pqE2lE/E---3.1_9765.p',pel62_7) ).
cnf(pel62_5,negated_conjecture,
( big_p(f(sk1))
| big_p(f(sk2))
| ~ big_p(sk1)
| ~ big_p(sk2) ),
file('/export/starexec/sandbox/tmp/tmp.Kam1pqE2lE/E---3.1_9765.p',pel62_5) ).
cnf(c_0_7,negated_conjecture,
( big_p(f(f(X1)))
| ~ big_p(f(X1))
| ~ big_p(a) ),
inference(fof_simplification,[status(thm)],[pel62_3]) ).
cnf(c_0_8,negated_conjecture,
( ~ big_p(f(f(sk1)))
| ~ big_p(f(f(sk2))) ),
inference(fof_simplification,[status(thm)],[pel62_4]) ).
cnf(c_0_9,negated_conjecture,
( big_p(f(f(X1)))
| ~ big_p(f(X1))
| ~ big_p(a) ),
c_0_7 ).
cnf(c_0_10,negated_conjecture,
big_p(a),
pel62_1 ).
cnf(c_0_11,negated_conjecture,
( ~ big_p(f(f(sk1)))
| ~ big_p(f(f(sk2))) ),
c_0_8 ).
cnf(c_0_12,negated_conjecture,
( big_p(f(f(X1)))
| ~ big_p(f(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).
cnf(c_0_13,negated_conjecture,
( big_p(f(f(X1)))
| big_p(X1)
| ~ big_p(a) ),
inference(fof_simplification,[status(thm)],[pel62_2]) ).
cnf(c_0_14,negated_conjecture,
( big_p(f(sk1))
| ~ big_p(sk1)
| ~ big_p(f(f(sk2))) ),
inference(fof_simplification,[status(thm)],[pel62_6]) ).
cnf(c_0_15,negated_conjecture,
( ~ big_p(f(f(sk1)))
| ~ big_p(f(sk2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( big_p(f(f(X1)))
| big_p(X1)
| ~ big_p(a) ),
c_0_13 ).
cnf(c_0_17,negated_conjecture,
( big_p(f(sk1))
| ~ big_p(sk1)
| ~ big_p(f(f(sk2))) ),
c_0_14 ).
cnf(c_0_18,negated_conjecture,
( ~ big_p(f(sk2))
| ~ big_p(f(sk1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_12]) ).
cnf(c_0_19,negated_conjecture,
( big_p(f(f(X1)))
| big_p(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_10])]) ).
cnf(c_0_20,negated_conjecture,
( big_p(f(sk2))
| ~ big_p(sk2)
| ~ big_p(f(f(sk1))) ),
inference(fof_simplification,[status(thm)],[pel62_7]) ).
cnf(c_0_21,negated_conjecture,
( ~ big_p(f(sk2))
| ~ big_p(sk1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_12]),c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( big_p(sk2)
| ~ big_p(f(f(sk1))) ),
inference(spm,[status(thm)],[c_0_11,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
( big_p(f(sk1))
| big_p(f(sk2))
| ~ big_p(sk1)
| ~ big_p(sk2) ),
inference(fof_simplification,[status(thm)],[pel62_5]) ).
cnf(c_0_24,negated_conjecture,
( big_p(f(sk2))
| ~ big_p(sk2)
| ~ big_p(f(f(sk1))) ),
c_0_20 ).
cnf(c_0_25,negated_conjecture,
~ big_p(f(sk2)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_19]),c_0_21]) ).
cnf(c_0_26,negated_conjecture,
( big_p(sk1)
| big_p(sk2) ),
inference(spm,[status(thm)],[c_0_22,c_0_19]) ).
cnf(c_0_27,negated_conjecture,
( big_p(f(sk1))
| big_p(f(sk2))
| ~ big_p(sk1)
| ~ big_p(sk2) ),
c_0_23 ).
cnf(c_0_28,negated_conjecture,
big_p(sk1),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_19]),c_0_25]),c_0_26]) ).
cnf(c_0_29,negated_conjecture,
( big_p(f(sk1))
| ~ big_p(sk1)
| ~ big_p(sk2) ),
inference(spm,[status(thm)],[c_0_25,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
( big_p(f(sk1))
| ~ big_p(f(f(sk2))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_28])]) ).
cnf(c_0_31,negated_conjecture,
( big_p(f(sk1))
| ~ big_p(sk2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_28])]) ).
cnf(c_0_32,negated_conjecture,
( big_p(sk2)
| ~ big_p(f(sk1)) ),
inference(spm,[status(thm)],[c_0_22,c_0_12]) ).
cnf(c_0_33,negated_conjecture,
big_p(f(sk1)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_19]),c_0_31]) ).
cnf(c_0_34,negated_conjecture,
big_p(sk2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]) ).
cnf(c_0_35,negated_conjecture,
~ big_p(f(f(sk1))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_34])]),c_0_25]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_12]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SYN084-2 : TPTP v8.1.2. Released v1.2.0.
% 0.10/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n015.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 11:08:36 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 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.Kam1pqE2lE/E---3.1_9765.p
% 0.21/0.49 # Version: 3.1.0
% 0.21/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.49 # Starting sh5l with 300s (1) cores
% 0.21/0.49 # new_bool_3 with pid 9869 completed with status 0
% 0.21/0.49 # Result found by new_bool_3
% 0.21/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.49 # Search class: FGHNF-FFSF11-SFFFFFNN
% 0.21/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.49 # SAT001_MinMin_p005000_rr_RG with pid 9873 completed with status 0
% 0.21/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.49 # Search class: FGHNF-FFSF11-SFFFFFNN
% 0.21/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.49 # Preprocessing time : 0.001 s
% 0.21/0.49 # Presaturation interreduction done
% 0.21/0.49
% 0.21/0.49 # Proof found!
% 0.21/0.49 # SZS status Unsatisfiable
% 0.21/0.49 # SZS output start CNFRefutation
% See solution above
% 0.21/0.49 # Parsed axioms : 7
% 0.21/0.49 # Removed by relevancy pruning/SinE : 0
% 0.21/0.49 # Initial clauses : 7
% 0.21/0.49 # Removed in clause preprocessing : 0
% 0.21/0.49 # Initial clauses in saturation : 7
% 0.21/0.49 # Processed clauses : 29
% 0.21/0.49 # ...of these trivial : 0
% 0.21/0.49 # ...subsumed : 1
% 0.21/0.49 # ...remaining for further processing : 28
% 0.21/0.49 # Other redundant clauses eliminated : 0
% 0.21/0.49 # Clauses deleted for lack of memory : 0
% 0.21/0.49 # Backward-subsumed : 6
% 0.21/0.49 # Backward-rewritten : 7
% 0.21/0.49 # Generated clauses : 19
% 0.21/0.49 # ...of the previous two non-redundant : 18
% 0.21/0.49 # ...aggressively subsumed : 0
% 0.21/0.49 # Contextual simplify-reflections : 4
% 0.21/0.49 # Paramodulations : 19
% 0.21/0.49 # Factorizations : 0
% 0.21/0.49 # NegExts : 0
% 0.21/0.49 # Equation resolutions : 0
% 0.21/0.49 # Disequality decompositions : 0
% 0.21/0.49 # Total rewrite steps : 11
% 0.21/0.49 # ...of those cached : 7
% 0.21/0.49 # Propositional unsat checks : 0
% 0.21/0.49 # Propositional check models : 0
% 0.21/0.49 # Propositional check unsatisfiable : 0
% 0.21/0.49 # Propositional clauses : 0
% 0.21/0.49 # Propositional clauses after purity: 0
% 0.21/0.49 # Propositional unsat core size : 0
% 0.21/0.49 # Propositional preprocessing time : 0.000
% 0.21/0.49 # Propositional encoding time : 0.000
% 0.21/0.49 # Propositional solver time : 0.000
% 0.21/0.49 # Success case prop preproc time : 0.000
% 0.21/0.49 # Success case prop encoding time : 0.000
% 0.21/0.49 # Success case prop solver time : 0.000
% 0.21/0.49 # Current number of processed clauses : 8
% 0.21/0.49 # Positive orientable unit clauses : 4
% 0.21/0.49 # Positive unorientable unit clauses: 0
% 0.21/0.49 # Negative unit clauses : 2
% 0.21/0.49 # Non-unit-clauses : 2
% 0.21/0.49 # Current number of unprocessed clauses: 0
% 0.21/0.49 # ...number of literals in the above : 0
% 0.21/0.49 # Current number of archived formulas : 0
% 0.21/0.49 # Current number of archived clauses : 20
% 0.21/0.49 # Clause-clause subsumption calls (NU) : 28
% 0.21/0.49 # Rec. Clause-clause subsumption calls : 28
% 0.21/0.49 # Non-unit clause-clause subsumptions : 5
% 0.21/0.49 # Unit Clause-clause subsumption calls : 8
% 0.21/0.49 # Rewrite failures with RHS unbound : 0
% 0.21/0.49 # BW rewrite match attempts : 3
% 0.21/0.49 # BW rewrite match successes : 3
% 0.21/0.49 # Condensation attempts : 0
% 0.21/0.49 # Condensation successes : 0
% 0.21/0.49 # Termbank termtop insertions : 395
% 0.21/0.49 # Search garbage collected termcells : 21
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.003 s
% 0.21/0.49 # System time : 0.002 s
% 0.21/0.49 # Total time : 0.005 s
% 0.21/0.49 # Maximum resident set size: 1600 pages
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.004 s
% 0.21/0.49 # System time : 0.004 s
% 0.21/0.49 # Total time : 0.008 s
% 0.21/0.49 # Maximum resident set size: 1696 pages
% 0.21/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------