TSTP Solution File: TOP049-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : TOP049-1 : TPTP v8.1.0. Released v8.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 : 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 : 600s
% DateTime : Thu Jul 21 21:25:45 EDT 2022
% Result : Unsatisfiable 0.20s 0.39s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : TOP049-1 : TPTP v8.1.0. Released v8.1.0.
% 0.13/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 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 : 600
% 0.13/0.34 % DateTime : Sun May 29 07:56:06 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.37 # No SInE strategy applied
% 0.20/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.20/0.37 #
% 0.20/0.37 # Presaturation interreduction done
% 0.20/0.37 # Number of axioms: 14 Number of unprocessed: 14
% 0.20/0.37 # Tableaux proof search.
% 0.20/0.37 # APR header successfully linked.
% 0.20/0.37 # Hello from C++
% 0.20/0.38 # The folding up rule is enabled...
% 0.20/0.38 # Local unification is enabled...
% 0.20/0.38 # Any saturation attempts will use folding labels...
% 0.20/0.38 # 14 beginning clauses after preprocessing and clausification
% 0.20/0.38 # Creating start rules for all 1 conjectures.
% 0.20/0.38 # There are 1 start rule candidates:
% 0.20/0.38 # Found 14 unit axioms.
% 0.20/0.38 # 1 start rule tableaux created.
% 0.20/0.38 # 0 extension rule candidate clauses
% 0.20/0.38 # 14 unit axiom clauses
% 0.20/0.38
% 0.20/0.38 # Requested 8, 32 cores available to the main process.
% 0.20/0.38 # There are not enough tableaux to fork, creating more from the initial 1
% 0.20/0.38 # Creating equality axioms
% 0.20/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.20/0.38 # Returning from population with 27 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.38 # We now have 27 tableaux to operate on
% 0.20/0.39 # There were 1 total branch saturation attempts.
% 0.20/0.39 # There were 0 of these attempts blocked.
% 0.20/0.39 # There were 0 deferred branch saturation attempts.
% 0.20/0.39 # There were 0 free duplicated saturations.
% 0.20/0.39 # There were 1 total successful branch saturations.
% 0.20/0.39 # There were 0 successful branch saturations in interreduction.
% 0.20/0.39 # There were 0 successful branch saturations on the branch.
% 0.20/0.39 # There were 1 successful branch saturations after the branch.
% 0.20/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.39 # Begin clausification derivation
% 0.20/0.39
% 0.20/0.39 # End clausification derivation
% 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.39 cnf(i_0_18, plain, (product(a9,a7)=a1)).
% 0.20/0.39 cnf(i_0_27, plain, (product(a4,a8)=a9)).
% 0.20/0.39 cnf(i_0_23, plain, (product(a6,a1)=a7)).
% 0.20/0.39 cnf(i_0_19, plain, (product(a1,a2)=a3)).
% 0.20/0.39 cnf(i_0_20, plain, (product(a3,a4)=a2)).
% 0.20/0.39 cnf(i_0_26, plain, (product(a10,a3)=a4)).
% 0.20/0.39 cnf(i_0_15, plain, (product(X1,X1)=X1)).
% 0.20/0.39 cnf(i_0_21, plain, (product(a2,a10)=a5)).
% 0.20/0.39 cnf(i_0_25, plain, (product(a8,a9)=a10)).
% 0.20/0.39 cnf(i_0_22, plain, (product(a5,a4)=a6)).
% 0.20/0.39 cnf(i_0_24, plain, (product(a7,a4)=a8)).
% 0.20/0.39 cnf(i_0_16, plain, (product(product(X1,X2),X2)=X1)).
% 0.20/0.39 cnf(i_0_17, plain, (product(product(X1,X2),product(X3,X2))=product(product(X1,X3),X2))).
% 0.20/0.39 cnf(i_0_28, negated_conjecture, (tuple(a1,a9,a8,a6,a7,a2,a3,a4,a5)!=tuple(a2,a10,a9,a7,a8,a3,a4,a5,a6))).
% 0.20/0.39 cnf(i_0_30, plain, (X4=X4)).
% 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.39 # Begin printing tableau
% 0.20/0.39 # Found 13 steps
% 0.20/0.39 cnf(i_0_18, plain, (product(a9,a7)=a1), inference(start_rule)).
% 0.20/0.39 cnf(i_0_36, plain, (product(a9,a7)=a1), inference(extension_rule, [i_0_35])).
% 0.20/0.39 cnf(i_0_62, plain, (product(a9,a7)!=a1), inference(closure_rule, [i_0_18])).
% 0.20/0.39 cnf(i_0_64, plain, (product(a9,a7)!=a1), inference(closure_rule, [i_0_18])).
% 0.20/0.39 cnf(i_0_65, plain, (product(a9,a7)!=a1), inference(closure_rule, [i_0_18])).
% 0.20/0.39 cnf(i_0_66, plain, (product(a9,a7)!=a1), inference(closure_rule, [i_0_18])).
% 0.20/0.39 cnf(i_0_67, plain, (product(a9,a7)!=a1), inference(closure_rule, [i_0_18])).
% 0.20/0.39 cnf(i_0_68, plain, (product(a9,a7)!=a1), inference(closure_rule, [i_0_18])).
% 0.20/0.39 cnf(i_0_69, plain, (product(a9,a7)!=a1), inference(closure_rule, [i_0_18])).
% 0.20/0.39 cnf(i_0_70, plain, (product(a9,a7)!=a1), inference(closure_rule, [i_0_18])).
% 0.20/0.39 cnf(i_0_61, plain, (tuple(product(a9,a7),product(a9,a7),product(a9,a7),product(a9,a7),product(a9,a7),product(a9,a7),product(a9,a7),product(a9,a7),product(a9,a7))=tuple(a1,a1,a1,a1,a1,a1,a1,a1,a1)), inference(extension_rule, [i_0_33])).
% 0.20/0.39 cnf(i_0_77, plain, (tuple(a1,a1,a1,a1,a1,a1,a1,a1,a1)!=product(tuple(a1,a1,a1,a1,a1,a1,a1,a1,a1),tuple(a1,a1,a1,a1,a1,a1,a1,a1,a1))), inference(closure_rule, [i_0_15])).
% 0.20/0.39 cnf(i_0_75, plain, (tuple(product(a9,a7),product(a9,a7),product(a9,a7),product(a9,a7),product(a9,a7),product(a9,a7),product(a9,a7),product(a9,a7),product(a9,a7))=product(tuple(a1,a1,a1,a1,a1,a1,a1,a1,a1),tuple(a1,a1,a1,a1,a1,a1,a1,a1,a1))), inference(etableau_closure_rule, [i_0_75, ...])).
% 0.20/0.39 # End printing tableau
% 0.20/0.39 # SZS output end
% 0.20/0.39 # Branches closed with saturation will be marked with an "s"
% 0.20/0.40 # Child (6777) has found a proof.
% 0.20/0.40
% 0.20/0.40 # Proof search is over...
% 0.20/0.40 # Freeing feature tree
%------------------------------------------------------------------------------