TSTP Solution File: SYN075-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYN075-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 : Tue May 21 07:56:58 EDT 2024
% Result : Unsatisfiable 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of clauses : 27 ( 5 unt; 8 nHn; 20 RR)
% Number of literals : 64 ( 40 equ; 34 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 46 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_4,negated_conjecture,
( f(X2) = X2
| ~ big_f(X1,f(X2))
| X1 != g(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
cnf(clause_6,negated_conjecture,
( big_f(X1,f(X2))
| f(X2) = X2
| X1 != g(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_9,negated_conjecture,
( big_f(h(X1,X2),f(X1))
| h(X1,X2) = X2
| f(X1) != X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_9) ).
cnf(clause_1,axiom,
( X1 = a
| ~ big_f(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
cnf(clause_10,negated_conjecture,
( f(X1) != X1
| h(X1,X2) != X2
| ~ big_f(h(X1,X2),f(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_10) ).
cnf(clause_3,axiom,
( big_f(X1,X2)
| X1 != a
| X2 != b ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
cnf(c_0_6,negated_conjecture,
( f(X2) = X2
| ~ big_f(X1,f(X2))
| X1 != g(X2) ),
inference(fof_simplification,[status(thm)],[clause_4]) ).
cnf(c_0_7,negated_conjecture,
( big_f(X1,f(X2))
| f(X2) = X2
| X1 != g(X2) ),
inference(fof_simplification,[status(thm)],[clause_6]) ).
cnf(c_0_8,negated_conjecture,
( f(X2) = X2
| ~ big_f(X1,f(X2))
| X1 != g(X2) ),
c_0_6 ).
cnf(c_0_9,negated_conjecture,
( big_f(h(X1,X2),f(X1))
| h(X1,X2) = X2
| f(X1) != X1 ),
inference(fof_simplification,[status(thm)],[clause_9]) ).
cnf(c_0_10,negated_conjecture,
( big_f(X1,f(X2))
| f(X2) = X2
| X1 != g(X2) ),
c_0_7 ).
cnf(c_0_11,negated_conjecture,
( f(X1) = X1
| ~ big_f(g(X1),f(X1)) ),
inference(er,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( X1 = a
| ~ big_f(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause_1]) ).
cnf(c_0_13,negated_conjecture,
( big_f(h(X1,X2),f(X1))
| h(X1,X2) = X2
| f(X1) != X1 ),
c_0_9 ).
cnf(c_0_14,negated_conjecture,
f(X1) = X1,
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_10]),c_0_11]) ).
cnf(c_0_15,negated_conjecture,
( f(X1) != X1
| h(X1,X2) != X2
| ~ big_f(h(X1,X2),f(X1)) ),
inference(fof_simplification,[status(thm)],[clause_10]) ).
cnf(c_0_16,plain,
( X1 = a
| ~ big_f(X1,X2) ),
c_0_12 ).
cnf(c_0_17,negated_conjecture,
( h(X1,X2) = X2
| big_f(h(X1,X2),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_14])]) ).
cnf(c_0_18,plain,
( big_f(X1,X2)
| X1 != a
| X2 != b ),
inference(fof_simplification,[status(thm)],[clause_3]) ).
cnf(c_0_19,negated_conjecture,
( f(X1) != X1
| h(X1,X2) != X2
| ~ big_f(h(X1,X2),f(X1)) ),
c_0_15 ).
cnf(c_0_20,negated_conjecture,
( h(X1,X2) = a
| h(X1,X2) = X2 ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( big_f(X1,X2)
| X1 != a
| X2 != b ),
c_0_18 ).
cnf(c_0_22,negated_conjecture,
( h(X1,X2) != X2
| ~ big_f(h(X1,X2),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_14]),c_0_14])]) ).
cnf(c_0_23,negated_conjecture,
h(X1,a) = a,
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_20])]) ).
cnf(c_0_24,plain,
big_f(a,b),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_21])]) ).
cnf(c_0_25,negated_conjecture,
~ big_f(a,X1),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
$false,
inference(sr,[status(thm)],[c_0_24,c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYN075-1 : TPTP v8.2.0. Released v1.0.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n026.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 : Mon May 20 15:23:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.50 Running first-order model finding
% 0.20/0.50 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.20/0.51 # Version: 3.1.0
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3738 completed with status 0
% 0.20/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FGHSF-FFSF21-SFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.51 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.51 # Starting sh5l with 136s (1) cores
% 0.20/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3743 completed with status 0
% 0.20/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FGHSF-FFSF21-SFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.51 # Preprocessing time : 0.001 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Unsatisfiable
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 10
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 10
% 0.20/0.51 # Removed in clause preprocessing : 1
% 0.20/0.51 # Initial clauses in saturation : 9
% 0.20/0.51 # Processed clauses : 25
% 0.20/0.51 # ...of these trivial : 0
% 0.20/0.51 # ...subsumed : 3
% 0.20/0.51 # ...remaining for further processing : 22
% 0.20/0.51 # Other redundant clauses eliminated : 8
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 0
% 0.20/0.51 # Backward-rewritten : 2
% 0.20/0.51 # Generated clauses : 19
% 0.20/0.51 # ...of the previous two non-redundant : 15
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 1
% 0.20/0.51 # Paramodulations : 9
% 0.20/0.51 # Factorizations : 2
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 8
% 0.20/0.51 # Disequality decompositions : 0
% 0.20/0.51 # Total rewrite steps : 10
% 0.20/0.51 # ...of those cached : 8
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 9
% 0.20/0.51 # Positive orientable unit clauses : 2
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 1
% 0.20/0.51 # Non-unit-clauses : 6
% 0.20/0.51 # Current number of unprocessed clauses: 5
% 0.20/0.51 # ...number of literals in the above : 11
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 9
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 5
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 5
% 0.20/0.51 # Non-unit clause-clause subsumptions : 4
% 0.20/0.51 # Unit Clause-clause subsumption calls : 0
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 1
% 0.20/0.51 # BW rewrite match successes : 1
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 432
% 0.20/0.51 # Search garbage collected termcells : 27
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.005 s
% 0.20/0.51 # System time : 0.000 s
% 0.20/0.51 # Total time : 0.005 s
% 0.20/0.51 # Maximum resident set size: 1632 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.016 s
% 0.20/0.51 # System time : 0.004 s
% 0.20/0.51 # Total time : 0.020 s
% 0.20/0.51 # Maximum resident set size: 1696 pages
% 0.20/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------