TSTP Solution File: GRP148-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP148-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 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 : n020.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 : Sat Jul 16 09:05:02 EDT 2022
% Result : Unsatisfiable 0.20s 0.42s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : GRP148-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.33 % Computer : n020.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jun 13 05:58:05 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic U_____102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 18 Number of unprocessed: 18
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.13/0.37 # The folding up rule is enabled...
% 0.13/0.37 # Local unification is enabled...
% 0.13/0.37 # Any saturation attempts will use folding labels...
% 0.13/0.37 # 18 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 1 conjectures.
% 0.13/0.37 # There are 1 start rule candidates:
% 0.13/0.37 # Found 18 unit axioms.
% 0.13/0.37 # 1 start rule tableaux created.
% 0.13/0.37 # 0 extension rule candidate clauses
% 0.13/0.37 # 18 unit axiom clauses
% 0.13/0.37
% 0.13/0.37 # Requested 8, 32 cores available to the main process.
% 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.13/0.37 # Creating equality axioms
% 0.13/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.37 # Returning from population with 26 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37 # We now have 26 tableaux to operate on
% 0.20/0.42 # There were 1 total branch saturation attempts.
% 0.20/0.42 # There were 0 of these attempts blocked.
% 0.20/0.42 # There were 0 deferred branch saturation attempts.
% 0.20/0.42 # There were 0 free duplicated saturations.
% 0.20/0.42 # There were 1 total successful branch saturations.
% 0.20/0.42 # There were 0 successful branch saturations in interreduction.
% 0.20/0.42 # There were 0 successful branch saturations on the branch.
% 0.20/0.42 # There were 1 successful branch saturations after the branch.
% 0.20/0.42 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.42 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.42 # Begin clausification derivation
% 0.20/0.42
% 0.20/0.42 # End clausification derivation
% 0.20/0.42 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.42 cnf(i_0_19, plain, (multiply(identity,X1)=X1)).
% 0.20/0.42 cnf(i_0_27, plain, (greatest_lower_bound(X1,X1)=X1)).
% 0.20/0.42 cnf(i_0_26, plain, (least_upper_bound(X1,X1)=X1)).
% 0.20/0.42 cnf(i_0_20, plain, (multiply(inverse(X1),X1)=identity)).
% 0.20/0.42 cnf(i_0_29, plain, (greatest_lower_bound(X1,least_upper_bound(X1,X2))=X1)).
% 0.20/0.42 cnf(i_0_28, plain, (least_upper_bound(X1,greatest_lower_bound(X1,X2))=X1)).
% 0.20/0.42 cnf(i_0_34, hypothesis, (least_upper_bound(c,a)=c)).
% 0.20/0.42 cnf(i_0_35, hypothesis, (least_upper_bound(c,b)=c)).
% 0.20/0.42 cnf(i_0_24, plain, (greatest_lower_bound(greatest_lower_bound(X1,X2),X3)=greatest_lower_bound(X1,greatest_lower_bound(X2,X3)))).
% 0.20/0.42 cnf(i_0_25, plain, (least_upper_bound(least_upper_bound(X1,X2),X3)=least_upper_bound(X1,least_upper_bound(X2,X3)))).
% 0.20/0.42 cnf(i_0_21, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))).
% 0.20/0.42 cnf(i_0_31, plain, (greatest_lower_bound(multiply(X1,X2),multiply(X1,X3))=multiply(X1,greatest_lower_bound(X2,X3)))).
% 0.20/0.42 cnf(i_0_30, plain, (least_upper_bound(multiply(X1,X2),multiply(X1,X3))=multiply(X1,least_upper_bound(X2,X3)))).
% 0.20/0.42 cnf(i_0_33, plain, (greatest_lower_bound(multiply(X1,X2),multiply(X3,X2))=multiply(greatest_lower_bound(X1,X3),X2))).
% 0.20/0.42 cnf(i_0_32, plain, (least_upper_bound(multiply(X1,X2),multiply(X3,X2))=multiply(least_upper_bound(X1,X3),X2))).
% 0.20/0.42 cnf(i_0_22, plain, (greatest_lower_bound(X1,X2)=greatest_lower_bound(X2,X1))).
% 0.20/0.42 cnf(i_0_23, plain, (least_upper_bound(X1,X2)=least_upper_bound(X2,X1))).
% 0.20/0.42 cnf(i_0_36, negated_conjecture, (greatest_lower_bound(c,least_upper_bound(a,b))!=least_upper_bound(a,b))).
% 0.20/0.42 cnf(i_0_38, plain, (X4=X4)).
% 0.20/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.42 # Begin printing tableau
% 0.20/0.42 # Found 6 steps
% 0.20/0.42 cnf(i_0_19, plain, (multiply(identity,least_upper_bound(a,b))=least_upper_bound(a,b)), inference(start_rule)).
% 0.20/0.42 cnf(i_0_46, plain, (multiply(identity,least_upper_bound(a,b))=least_upper_bound(a,b)), inference(extension_rule, [i_0_41])).
% 0.20/0.42 cnf(i_0_69, plain, (greatest_lower_bound(c,least_upper_bound(a,b))=least_upper_bound(a,b)), inference(closure_rule, [i_0_36])).
% 0.20/0.42 cnf(i_0_70, plain, (greatest_lower_bound(c,least_upper_bound(a,b))!=multiply(identity,least_upper_bound(a,b))), inference(extension_rule, [i_0_41])).
% 0.20/0.42 cnf(i_0_88, plain, (greatest_lower_bound(c,least_upper_bound(a,b))!=multiply(identity,greatest_lower_bound(c,least_upper_bound(a,b)))), inference(closure_rule, [i_0_19])).
% 0.20/0.42 cnf(i_0_89, plain, (multiply(identity,greatest_lower_bound(c,least_upper_bound(a,b)))!=multiply(identity,least_upper_bound(a,b))), inference(etableau_closure_rule, [i_0_89, ...])).
% 0.20/0.42 # End printing tableau
% 0.20/0.42 # SZS output end
% 0.20/0.42 # Branches closed with saturation will be marked with an "s"
% 0.20/0.42 # Child (15500) has found a proof.
% 0.20/0.42
% 0.20/0.42 # Proof search is over...
% 0.20/0.42 # Freeing feature tree
%------------------------------------------------------------------------------