TSTP Solution File: SWV879-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWV879-1 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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 05:32:21 EDT 2024
% Result : Unsatisfiable 0.37s 0.74s
% Output : CNFRefutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 33 ( 21 unt; 0 nHn; 23 RR)
% Number of literals : 48 ( 10 equ; 22 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 8 con; 0-4 aty)
% Number of variables : 57 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_3,negated_conjecture,
~ hBOOL(hAPP(hAPP(v_P,c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a)),c_Set_Oinsert(hAPP(v_mgt__call,v_x),c_Orderings_Obot__class_Obot(tc_fun(t_a,tc_bool)),t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_conjecture_1,negated_conjecture,
v_G = c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_assms_I1_J_0,axiom,
( hBOOL(hAPP(hAPP(v_P,X1),X2))
| ~ c_lessequals(X2,X1,tc_fun(t_a,tc_bool)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_assms_I1_J_0) ).
cnf(cls_insert__absorb_0,axiom,
( c_Set_Oinsert(X1,X2,X3) = X2
| ~ hBOOL(c_in(X1,X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_insert__absorb_0) ).
cnf(cls_insert__subset_2,axiom,
( c_lessequals(c_Set_Oinsert(X1,X2,X3),X4,tc_fun(X3,tc_bool))
| ~ c_lessequals(X2,X4,tc_fun(X3,tc_bool))
| ~ hBOOL(c_in(X1,X4,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_insert__subset_2) ).
cnf(cls_image__insert_0,axiom,
c_Set_Oimage(X1,c_Set_Oinsert(X2,X3,X4),X4,X5) = c_Set_Oinsert(hAPP(X1,X2),c_Set_Oimage(X1,X3,X4,X5),X5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_image__insert_0) ).
cnf(cls_conjecture_2,negated_conjecture,
hBOOL(c_in(v_x,v_U,tc_Com_Opname)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_empty__subsetI_0,axiom,
c_lessequals(c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)),X2,tc_fun(X1,tc_bool)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_empty__subsetI_0) ).
cnf(cls_mem__def_1,axiom,
( hBOOL(c_in(X1,X2,X3))
| ~ hBOOL(hAPP(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_mem__def_1) ).
cnf(cls_insert__code_1,axiom,
hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_insert__code_1) ).
cnf(c_0_10,negated_conjecture,
~ hBOOL(hAPP(hAPP(v_P,c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a)),c_Set_Oinsert(hAPP(v_mgt__call,v_x),c_Orderings_Obot__class_Obot(tc_fun(t_a,tc_bool)),t_a))),
inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).
cnf(c_0_11,negated_conjecture,
~ hBOOL(hAPP(hAPP(v_P,c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a)),c_Set_Oinsert(hAPP(v_mgt__call,v_x),c_Orderings_Obot__class_Obot(tc_fun(t_a,tc_bool)),t_a))),
c_0_10 ).
cnf(c_0_12,negated_conjecture,
v_G = c_Set_Oimage(v_mgt__call,v_U,tc_Com_Opname,t_a),
cls_conjecture_1 ).
cnf(c_0_13,plain,
( hBOOL(hAPP(hAPP(v_P,X1),X2))
| ~ c_lessequals(X2,X1,tc_fun(t_a,tc_bool)) ),
inference(fof_simplification,[status(thm)],[cls_assms_I1_J_0]) ).
cnf(c_0_14,plain,
( c_Set_Oinsert(X1,X2,X3) = X2
| ~ hBOOL(c_in(X1,X2,X3)) ),
inference(fof_simplification,[status(thm)],[cls_insert__absorb_0]) ).
cnf(c_0_15,negated_conjecture,
~ hBOOL(hAPP(hAPP(v_P,v_G),c_Set_Oinsert(hAPP(v_mgt__call,v_x),c_Orderings_Obot__class_Obot(tc_fun(t_a,tc_bool)),t_a))),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( hBOOL(hAPP(hAPP(v_P,X1),X2))
| ~ c_lessequals(X2,X1,tc_fun(t_a,tc_bool)) ),
c_0_13 ).
cnf(c_0_17,plain,
( c_lessequals(c_Set_Oinsert(X1,X2,X3),X4,tc_fun(X3,tc_bool))
| ~ c_lessequals(X2,X4,tc_fun(X3,tc_bool))
| ~ hBOOL(c_in(X1,X4,X3)) ),
inference(fof_simplification,[status(thm)],[cls_insert__subset_2]) ).
cnf(c_0_18,axiom,
c_Set_Oimage(X1,c_Set_Oinsert(X2,X3,X4),X4,X5) = c_Set_Oinsert(hAPP(X1,X2),c_Set_Oimage(X1,X3,X4,X5),X5),
cls_image__insert_0 ).
cnf(c_0_19,plain,
( c_Set_Oinsert(X1,X2,X3) = X2
| ~ hBOOL(c_in(X1,X2,X3)) ),
c_0_14 ).
cnf(c_0_20,negated_conjecture,
hBOOL(c_in(v_x,v_U,tc_Com_Opname)),
cls_conjecture_2 ).
cnf(c_0_21,negated_conjecture,
~ c_lessequals(c_Set_Oinsert(hAPP(v_mgt__call,v_x),c_Orderings_Obot__class_Obot(tc_fun(t_a,tc_bool)),t_a),v_G,tc_fun(t_a,tc_bool)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
( c_lessequals(c_Set_Oinsert(X1,X2,X3),X4,tc_fun(X3,tc_bool))
| ~ c_lessequals(X2,X4,tc_fun(X3,tc_bool))
| ~ hBOOL(c_in(X1,X4,X3)) ),
c_0_17 ).
cnf(c_0_23,axiom,
c_lessequals(c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)),X2,tc_fun(X1,tc_bool)),
cls_empty__subsetI_0 ).
cnf(c_0_24,plain,
( hBOOL(c_in(X1,X2,X3))
| ~ hBOOL(hAPP(X2,X1)) ),
inference(fof_simplification,[status(thm)],[cls_mem__def_1]) ).
cnf(c_0_25,negated_conjecture,
c_Set_Oimage(v_mgt__call,c_Set_Oinsert(X1,v_U,tc_Com_Opname),tc_Com_Opname,t_a) = c_Set_Oinsert(hAPP(v_mgt__call,X1),v_G,t_a),
inference(spm,[status(thm)],[c_0_18,c_0_12]) ).
cnf(c_0_26,negated_conjecture,
c_Set_Oinsert(v_x,v_U,tc_Com_Opname) = v_U,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,negated_conjecture,
~ hBOOL(c_in(hAPP(v_mgt__call,v_x),v_G,t_a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_28,plain,
( hBOOL(c_in(X1,X2,X3))
| ~ hBOOL(hAPP(X2,X1)) ),
c_0_24 ).
cnf(c_0_29,axiom,
hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),X1)),
cls_insert__code_1 ).
cnf(c_0_30,negated_conjecture,
c_Set_Oinsert(hAPP(v_mgt__call,v_x),v_G,t_a) = v_G,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_12]) ).
cnf(c_0_31,negated_conjecture,
~ hBOOL(hAPP(v_G,hAPP(v_mgt__call,v_x))),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV879-1 : TPTP v8.2.0. Released v4.1.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 07:09:23 EDT 2024
% 0.13/0.34 % 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/benchmark/theBenchmark.p
% 0.37/0.74 # Version: 3.1.0
% 0.37/0.74 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.37/0.74 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.74 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.37/0.74 # Starting new_bool_3 with 300s (1) cores
% 0.37/0.74 # Starting new_bool_1 with 300s (1) cores
% 0.37/0.74 # Starting sh5l with 300s (1) cores
% 0.37/0.74 # new_bool_3 with pid 12564 completed with status 0
% 0.37/0.74 # Result found by new_bool_3
% 0.37/0.74 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.37/0.74 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.74 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.37/0.74 # Starting new_bool_3 with 300s (1) cores
% 0.37/0.74 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.37/0.74 # Search class: FGHSM-FSLM32-DFFFFFNN
% 0.37/0.74 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.37/0.74 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 0.37/0.74 # G-E--_301_C18_F1_URBAN_S5PRR_S0Y with pid 12574 completed with status 0
% 0.37/0.74 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_S0Y
% 0.37/0.74 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.37/0.74 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.74 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.37/0.74 # Starting new_bool_3 with 300s (1) cores
% 0.37/0.74 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.37/0.74 # Search class: FGHSM-FSLM32-DFFFFFNN
% 0.37/0.74 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.37/0.74 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 0.37/0.74 # Preprocessing time : 0.026 s
% 0.37/0.74
% 0.37/0.74 # Proof found!
% 0.37/0.74 # SZS status Unsatisfiable
% 0.37/0.74 # SZS output start CNFRefutation
% See solution above
% 0.37/0.74 # Parsed axioms : 913
% 0.37/0.74 # Removed by relevancy pruning/SinE : 550
% 0.37/0.74 # Initial clauses : 363
% 0.37/0.74 # Removed in clause preprocessing : 0
% 0.37/0.74 # Initial clauses in saturation : 363
% 0.37/0.74 # Processed clauses : 439
% 0.37/0.74 # ...of these trivial : 8
% 0.37/0.74 # ...subsumed : 101
% 0.37/0.74 # ...remaining for further processing : 330
% 0.37/0.74 # Other redundant clauses eliminated : 3
% 0.37/0.74 # Clauses deleted for lack of memory : 0
% 0.37/0.74 # Backward-subsumed : 2
% 0.37/0.74 # Backward-rewritten : 2
% 0.37/0.74 # Generated clauses : 7151
% 0.37/0.74 # ...of the previous two non-redundant : 5907
% 0.37/0.74 # ...aggressively subsumed : 0
% 0.37/0.74 # Contextual simplify-reflections : 3
% 0.37/0.74 # Paramodulations : 7139
% 0.37/0.74 # Factorizations : 4
% 0.37/0.74 # NegExts : 0
% 0.37/0.74 # Equation resolutions : 8
% 0.37/0.74 # Disequality decompositions : 0
% 0.37/0.74 # Total rewrite steps : 2875
% 0.37/0.74 # ...of those cached : 2129
% 0.37/0.74 # Propositional unsat checks : 0
% 0.37/0.74 # Propositional check models : 0
% 0.37/0.74 # Propositional check unsatisfiable : 0
% 0.37/0.74 # Propositional clauses : 0
% 0.37/0.74 # Propositional clauses after purity: 0
% 0.37/0.74 # Propositional unsat core size : 0
% 0.37/0.74 # Propositional preprocessing time : 0.000
% 0.37/0.74 # Propositional encoding time : 0.000
% 0.37/0.74 # Propositional solver time : 0.000
% 0.37/0.74 # Success case prop preproc time : 0.000
% 0.37/0.74 # Success case prop encoding time : 0.000
% 0.37/0.74 # Success case prop solver time : 0.000
% 0.37/0.74 # Current number of processed clauses : 326
% 0.37/0.74 # Positive orientable unit clauses : 84
% 0.37/0.74 # Positive unorientable unit clauses: 9
% 0.37/0.74 # Negative unit clauses : 14
% 0.37/0.74 # Non-unit-clauses : 219
% 0.37/0.74 # Current number of unprocessed clauses: 5814
% 0.37/0.74 # ...number of literals in the above : 13879
% 0.37/0.74 # Current number of archived formulas : 0
% 0.37/0.74 # Current number of archived clauses : 4
% 0.37/0.74 # Clause-clause subsumption calls (NU) : 5323
% 0.37/0.74 # Rec. Clause-clause subsumption calls : 4426
% 0.37/0.74 # Non-unit clause-clause subsumptions : 76
% 0.37/0.74 # Unit Clause-clause subsumption calls : 380
% 0.37/0.74 # Rewrite failures with RHS unbound : 0
% 0.37/0.74 # BW rewrite match attempts : 938
% 0.37/0.74 # BW rewrite match successes : 70
% 0.37/0.74 # Condensation attempts : 0
% 0.37/0.74 # Condensation successes : 0
% 0.37/0.74 # Termbank termtop insertions : 183748
% 0.37/0.74 # Search garbage collected termcells : 2998
% 0.37/0.74
% 0.37/0.74 # -------------------------------------------------
% 0.37/0.74 # User time : 0.214 s
% 0.37/0.74 # System time : 0.013 s
% 0.37/0.74 # Total time : 0.227 s
% 0.37/0.74 # Maximum resident set size: 2888 pages
% 0.37/0.74
% 0.37/0.74 # -------------------------------------------------
% 0.37/0.74 # User time : 0.241 s
% 0.37/0.74 # System time : 0.015 s
% 0.37/0.74 # Total time : 0.256 s
% 0.37/0.74 # Maximum resident set size: 2400 pages
% 0.37/0.74 % E---3.1 exiting
% 0.37/0.74 % E exiting
%------------------------------------------------------------------------------