TSTP Solution File: SYN072+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN072+1 : TPTP v8.1.0. Released v2.0.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 : n025.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 06:07:54 EDT 2022
% Result : Theorem 0.19s 0.36s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYN072+1 : TPTP v8.1.0. Released v2.0.0.
% 0.00/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 : n025.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 : Tue Jul 12 01:19:32 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.36 # No SInE strategy applied
% 0.19/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.19/0.36 #
% 0.19/0.36 # Presaturation interreduction done
% 0.19/0.36 # Number of axioms: 5 Number of unprocessed: 5
% 0.19/0.36 # Tableaux proof search.
% 0.19/0.36 # APR header successfully linked.
% 0.19/0.36 # Hello from C++
% 0.19/0.36 # The folding up rule is enabled...
% 0.19/0.36 # Local unification is enabled...
% 0.19/0.36 # Any saturation attempts will use folding labels...
% 0.19/0.36 # 5 beginning clauses after preprocessing and clausification
% 0.19/0.36 # Creating start rules for all 1 conjectures.
% 0.19/0.36 # There are 1 start rule candidates:
% 0.19/0.36 # Found 4 unit axioms.
% 0.19/0.36 # 1 start rule tableaux created.
% 0.19/0.36 # 1 extension rule candidate clauses
% 0.19/0.36 # 4 unit axiom clauses
% 0.19/0.36
% 0.19/0.36 # Requested 8, 32 cores available to the main process.
% 0.19/0.36 # There are not enough tableaux to fork, creating more from the initial 1
% 0.19/0.36 # Creating equality axioms
% 0.19/0.36 # Ran out of tableaux, making start rules for all clauses
% 0.19/0.36 # There were 4 total branch saturation attempts.
% 0.19/0.36 # There were 0 of these attempts blocked.
% 0.19/0.36 # There were 0 deferred branch saturation attempts.
% 0.19/0.36 # There were 0 free duplicated saturations.
% 0.19/0.36 # There were 4 total successful branch saturations.
% 0.19/0.36 # There were 0 successful branch saturations in interreduction.
% 0.19/0.36 # There were 0 successful branch saturations on the branch.
% 0.19/0.36 # There were 4 successful branch saturations after the branch.
% 0.19/0.36 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.36 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.36 # Begin clausification derivation
% 0.19/0.36
% 0.19/0.36 # End clausification derivation
% 0.19/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.36 cnf(i_0_2, plain, (big_p(a))).
% 0.19/0.36 cnf(i_0_3, plain, (big_p(b))).
% 0.19/0.36 cnf(i_0_5, negated_conjecture, (~big_p(esk3_0))).
% 0.19/0.36 cnf(i_0_4, plain, (a!=b)).
% 0.19/0.36 cnf(i_0_1, plain, (X1=esk2_0|X1=esk1_0)).
% 0.19/0.36 cnf(i_0_9, plain, (X8=X8)).
% 0.19/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.36 # Begin printing tableau
% 0.19/0.36 # Found 7 steps
% 0.19/0.36 cnf(i_0_2, plain, (big_p(a)), inference(start_rule)).
% 0.19/0.36 cnf(i_0_14, plain, (big_p(a)), inference(extension_rule, [i_0_13])).
% 0.19/0.36 cnf(i_0_30, plain, (big_p(esk3_0)), inference(closure_rule, [i_0_5])).
% 0.19/0.36 cnf(i_0_31, plain, (a!=esk3_0), inference(extension_rule, [i_0_12])).
% 0.19/0.36 cnf(i_0_40, plain, (a!=esk1_0), inference(extension_rule, [i_0_1])).
% 0.19/0.36 cnf(i_0_41, plain, (esk3_0!=esk1_0), inference(etableau_closure_rule, [i_0_41, ...])).
% 0.19/0.36 cnf(i_0_45, plain, (esk2_0=a), inference(etableau_closure_rule, [i_0_45, ...])).
% 0.19/0.36 # End printing tableau
% 0.19/0.36 # SZS output end
% 0.19/0.36 # Branches closed with saturation will be marked with an "s"
% 0.19/0.36 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.36 # We now have 7 tableaux to operate on
% 0.19/0.36 # Found closed tableau during pool population.
% 0.19/0.36 # Proof search is over...
% 0.19/0.36 # Freeing feature tree
%------------------------------------------------------------------------------