TSTP Solution File: SYO617-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYO617-1 : TPTP v8.1.0. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n003.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 : 600s
% DateTime : Thu Jul 21 16:05:46 EDT 2022
% Result : Unsatisfiable 0.18s 0.39s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.12 % Problem : SYO617-1 : TPTP v8.1.0. Released v7.1.0.
% 0.01/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n003.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jul 9 15:45:43 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.36 # No SInE strategy applied
% 0.18/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S032N
% 0.18/0.36 # and selection function SelectUnlessUniqMax.
% 0.18/0.36 #
% 0.18/0.36 # Presaturation interreduction done
% 0.18/0.36 # Number of axioms: 7 Number of unprocessed: 7
% 0.18/0.36 # Tableaux proof search.
% 0.18/0.36 # APR header successfully linked.
% 0.18/0.36 # Hello from C++
% 0.18/0.36 # The folding up rule is enabled...
% 0.18/0.36 # Local unification is enabled...
% 0.18/0.36 # Any saturation attempts will use folding labels...
% 0.18/0.36 # 7 beginning clauses after preprocessing and clausification
% 0.18/0.36 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive.
% 0.18/0.36 # No conjectures.
% 0.18/0.36 # There are 7 start rule candidates:
% 0.18/0.36 # Found 1 unit axioms.
% 0.18/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.18/0.36 # 7 start rule tableaux created.
% 0.18/0.36 # 6 extension rule candidate clauses
% 0.18/0.36 # 1 unit axiom clauses
% 0.18/0.36
% 0.18/0.36 # Requested 8, 32 cores available to the main process.
% 0.18/0.36 # There are not enough tableaux to fork, creating more from the initial 7
% 0.18/0.36 # Returning from population with 15 new_tableaux and 0 remaining starting tableaux.
% 0.18/0.36 # We now have 15 tableaux to operate on
% 0.18/0.39 # There were 1 total branch saturation attempts.
% 0.18/0.39 # There were 0 of these attempts blocked.
% 0.18/0.39 # There were 0 deferred branch saturation attempts.
% 0.18/0.39 # There were 0 free duplicated saturations.
% 0.18/0.39 # There were 1 total successful branch saturations.
% 0.18/0.39 # There were 0 successful branch saturations in interreduction.
% 0.18/0.39 # There were 0 successful branch saturations on the branch.
% 0.18/0.39 # There were 1 successful branch saturations after the branch.
% 0.18/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.39 # Begin clausification derivation
% 0.18/0.39
% 0.18/0.39 # End clausification derivation
% 0.18/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.39 cnf(i_0_8, plain, (le(X1,X1))).
% 0.18/0.39 cnf(i_0_10, plain, (le(X1,X2)|~le(max(X3,X1),X2))).
% 0.18/0.39 cnf(i_0_9, plain, (le(X1,X2)|~le(max(X1,X3),X2))).
% 0.18/0.39 cnf(i_0_12, plain, (~eq(f(X1),a0)|~eq(f(X2),a0)|~le(s(X2),X1))).
% 0.18/0.39 cnf(i_0_13, plain, (~eq(f(X1),a1)|~eq(f(X2),a1)|~le(s(X2),X1))).
% 0.18/0.39 cnf(i_0_11, plain, (eq(f(X1),a2)|eq(f(X1),a1)|eq(f(X1),a0))).
% 0.18/0.39 cnf(i_0_14, plain, (~eq(f(X1),a2)|~eq(f(X2),a2)|~le(s(X2),X1))).
% 0.18/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.39 # Begin printing tableau
% 0.18/0.39 # Found 5 steps
% 0.18/0.39 cnf(i_0_9, plain, (le(max(X11,max(X5,X9)),max(max(X11,max(X5,X9)),X10))|~le(max(max(X11,max(X5,X9)),X10),max(max(X11,max(X5,X9)),X10))), inference(start_rule)).
% 0.18/0.39 cnf(i_0_19, plain, (~le(max(max(X11,max(X5,X9)),X10),max(max(X11,max(X5,X9)),X10))), inference(closure_rule, [i_0_8])).
% 0.18/0.39 cnf(i_0_18, plain, (le(max(X11,max(X5,X9)),max(max(X11,max(X5,X9)),X10))), inference(extension_rule, [i_0_10])).
% 0.18/0.39 cnf(i_0_64, plain, (le(max(X5,X9),max(max(X11,max(X5,X9)),X10))), inference(extension_rule, [i_0_9])).
% 0.18/0.39 cnf(i_0_66, plain, (le(X5,max(max(X11,max(X5,X9)),X10))), inference(etableau_closure_rule, [i_0_66, ...])).
% 0.18/0.39 # End printing tableau
% 0.18/0.39 # SZS output end
% 0.18/0.39 # Branches closed with saturation will be marked with an "s"
% 0.18/0.39 # Child (25752) has found a proof.
% 0.18/0.39
% 0.18/0.39 # Proof search is over...
% 0.18/0.39 # Freeing feature tree
%------------------------------------------------------------------------------